Re: Howto model decoupled hierarchies?


Neo schrieb:

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:

It not the vertex / point storing this data. It's at contour-level.
Means for each contour we calculate the convex hull and kD-tree.
- A convex hull is some kind of simplified contour (it resembles some
kind of deformed circle) and also have lots of vertices (the vertices
of the contour).
- A kD-Tree is an "ordered" set of the vertices that allows fast
discovery of the points next to any arbitrary other point. The kD-tree
is actually a 2D-tree

Regards,
Thomas Kowalski

.

Relevant Pages

  • Re: Howto model decoupled hierarchies?
    ... calculated data might be the convex hull of the contour (closed ... section of your mesh into some product at the highest level, ... hull, KD-Tree, simple array - doesn't matter). ... I the convex hull, kd-tree and other temponaries are just the first ...
    (comp.object)
  • Re: Howto model decoupled hierarchies?
    ... Means for each contour we calculate the convex hull and kD-tree. ... kind of deformed circle) and also have lots of vertices (the vertices ...
    (comp.object)
  • Re: Howto model decoupled hierarchies?
    ... Means for each contour we calculate the convex hull and kD-tree. ... and closestNodes and convexHull are derived data. ...
    (comp.object)
  • Re: Edge contour for scattered data
    ... contour. ... P.S. griddata extrapolates to the convex hull. ... Go on the file exchange and look at the file "ashape" by us. ...
    (comp.soft-sys.matlab)
  • Edge contour for scattered data
    ... and I need to determine the points that lie on the edge ... contour. ... P.S. griddata extrapolates to the convex hull. ...
    (comp.soft-sys.matlab)