Created 2006-11-12 Modified 2007-01-01
Chelton Evans
Linked Shapes
Linked shapes are like linked simplexes without the mathematical elegance. They are necessary because they occure naturally. For example the dual of a Delaunay triangulation.
Integer indexes to the global points. Have each point associated with an opposite edge.
In 2D this data structure is easy to realize. Let the order of the points be anti clockwise and the face be associated with the point 1+floor(N/2) where N is the number of faces.
In programming I am going to represent the linked shape as a linked list of integer points.