Re: Howto model decoupled hierarchies?

Is the calculated data a vector from each point to adjacent points ...

Nearly. calculated data might be the convex hull of the contour (closed
polygon) or a kD-Tree.

Ok, so each point stores 2 types of calculated data. Let me try to
under these data types:

Convex of Hull:
How many convex of hulls can a pointX need to store?
For each convex, does it need to store the points which make up the
polygon?
Is pointX somewhere near the middle of the polygon?
Or is pointX one of the corners of various polygons?

kD-Tree:
I am assuming, pointX is the single root of a hierarchy of points. How
many levels deep can the hierarchy be? What is the relationship between
parent and child in hierarchy? Proximity?

.

Relevant Pages