smbinterp/lib/grid.py

#!/usr/bin/python

import sys
import re

import numpy as np
import scipy.spatial

from tools import exact_func
from smcqdelaunay import *

class face(object):
  def __init__(self, name):
    self.name      = name
    self.verts     = []
    self.neighbors = []

  def add_vert(self, v):
    self.verts.append(v)

  def add_neighbor(self, n):
    self.neighbors.append(n)

  def __str__(self):
    neighbors = [i.name for i in self.neighbors]
    return '%s: points: %s neighbors: [%s]' %\
           (
             self.name,
             self.verts,
             ", ".join(neighbors)
           )

class grid(object):
  def __init__(self, points, q):
    """
      this thing eats two pre-constructed arrays of stuff:
      points = array of arrays (2 for 2D, 3 for 3D)
      q      = array (1D) of important values
    """

    self.points = np.array(points)
    self.q      = np.array(q)
    self.faces  = {}

  def construct_connectivity(self, s):
    facet_re = re.compile(r'''
                              -\s+(?P<facet>f\d+).*?
                              vertices:\s(?P<verts>.*?)\n.*?
                              neighboring\s facets:\s+(?P<neigh>[\sf\d]*)
                           ''', re.S|re.X)

    vert_re  = re.compile(r'''
                              (p\d+)
                           ''', re.S|re.X)


    rajoutter = []

    for matcher in facet_re.finditer(s):
      d = matcher.groupdict()
      facet_name = d['facet']
      verticies  = d['verts']
      neighbors  = d['neigh']

      cur_face = face(facet_name)
      self.faces[facet_name] = cur_face

      for v in vert_re.findall(verticies):
        cur_face.add_vert(int(v[1:]))

      nghbrs = [(facet_name, i) for i in  neighbors.split()]
      rajoutter.extend(nghbrs)

    for rel in rajoutter:
      if rel[1] in self.faces:
        self.faces[rel[0]].add_neighbor(self.faces[rel[1]])

  def for_qhull_generator(self):
    """
      this returns a generator that should be fed into qdelaunay
    """

    yield '2';
    yield '%d' % len(self.points)

    for p in self.points:
      yield "%f %f" % (p[0], p[1])

  def for_qhull(self):
    """
      this returns a single string that should be fed into qdelaunay
    """
    r  = '2\n'
    r += '%d\n' % len(self.points)
    for p in self.points:
      r += "%f %f\n" % (p[0], p[1])
    return r

  def __str__(self):
    r = ''
    assert( len(self.points) == len(self.q) )
    for c, i in enumerate(zip(self.points, self.q)):
      r += "%d %r: %0.4f\n" % (c,i[0], i[1])
    if self.faces:
      for v in self.faces.itervalues():
        r += "%s\n" % v
    return r

class simple_rect_grid(grid):
  def __init__(self, xres = 5, yres = 5):
    xmin = -1.0
    xmax =  1.0
    xspan = xmax - xmin
    xdel = xspan / float(xres - 1)

    ymin = -1.0
    ymay =  1.0
    yspan = ymay - ymin
    ydel = yspan / float(yres - 1)


    points = []
    q      = []
    for x in xrange(xres):
      cur_x = xmin + (x * xdel)
      for y in xrange(yres):
        cur_y = ymin + (y * ydel)
        points.append([cur_x, cur_y])
        q.append(exact_func(cur_x, cur_y))
    grid.__init__(self, points, q)



class simple_random_grid(simple_rect_grid):
  def __init__(self, num_points = 10):
    points = []
    q = []

    r = np.random

    for i in xrange(num_points):
      cur_x = r.rand()
      cur_y = r.rand()

      points.append([cur_x, cur_y])
      q.append(exact_func(cur_x, cur_y))
    grid.__init__(self, points, q)

    self.points = np.array(self.points)
    self.q      = np.array(self.q)


if __name__ == '__main__':
  try:
    resolution = int(sys.argv[1])
  except:
    resolution = 10
  g = simple_rect_grid(resolution, resolution)
  print g.for_qhull()