Recent changes to this wiki:

Various work on the UI.
added K_SEGMENT back in
added more classes
removed bad cython lines
started a cython wrapper
added some debugging statements
committing before i break something..
see this line:
if self.num_vars > 0 and self.num_coeffs > 1: #FIXME
added K_RATPOLY::subst_val_proto
functions implemented:
* gen_curve_topo
* K_RATPOLY::add_ratpoly
* K_RATPOLY::mul
* K_RATPOLY::subst_param_expr
* K_RATPOLY::eval_range
working on:
* Patch::intersect
* get_pts_proto_2
* gen_curve_topo_proto
continued on get_patch4
lots of debugging
Implemented BOXCO2.
implemented K_SEGMENT, trying to fix get_patch4
started working on get_patch4 again
marking where more work needs to be done
worked on Curve
added K_PATCH::set_range
replaced method stubs with NotImplementedError
added K_BOX3D
implemented subst_expr
implemented eval_range_in_out
added Surface.get_range
propagated surface values in get_patch4
moved __repr__ around and removed a random print statement
a simple python script to build a box
implemented Patch, Curve, fixed lots of stuff
fixed K_RATPOLY.__init__ and Surface.__init__
implemented Surface.__init__
None was not valid in that location
called Fraction.numerator/denominator
implemented reduce_num_coeffs
Imported gcd from fractions module.
implemented reduce_deg
implemented get_plane_coeffs
fixed gen_box a little but not completely
stubbed out K_RATPOLY
fixed get_coeff calls to be valid python
added gen_box to generate a 3D box from points
Some of this could be replaced by scipy.interpolate.bisplrep.
fixed broken length check
initial unit tests for the new esolid implementation
fixed various syntax errors
wrote Point2D.refine_interior
still working on Point2D
Wrote out get_pts_interior and fixed sort_ to return whether or not all
points are distinct.
minor, but important changes
get_pts: points -> pts in the parameter list
Also, just return the list of points.
get_pts_interior: updated the parameter list.
Graph.get_connected_components: changed it to return the components and
graphs.
todo:
Graph.gen_adjacency needs to be fixed to account for the updated
version of Graph.get_connected_components. There's a mismatch in the
expected return values.
Much of this artifact of the way that pointers were used in the original
code base.
updated Point2D in esolid
Point2D.equiv
Point2D.equal
Point2D.equal_s
Point2D.equal_t
Point2D.get_pts
Computes the intersections "pts" of 2 bivariate polynomials P1 and
P2 on/in the region [l_s, h_s] x [l_t, h_t]. Returns the number of
intersections (and the intersections).
a partial python implementation of esolid
some notes on python intricacies and good geometry APIs from 2010-10-06
import an old sample of what i am working towards
a simple todo list before i forget
first steps towards a working visualizer
some nurbs classes and routines
this time with code
this is uglier than i thought it would be
Initial content.