search

tomilov / quickhull

Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.
https://habr.com/ru/articles/245221/
70 stars 8 forks source link

qh.facets_; How do I get the points? #15

Open ligonap opened 3 months ago

ligonap commented 3 months ago

Hello!

In your example, the line "qh.facets_; // use as result" can be found at the bottom.

How can I get all triangles and their points from this? There are many iterators behind the code, but nothing immediately recognizable that can be accessed immediately.

tomilov commented 1 month ago

vertices_ relates to facet vertices. Type of iterator clearly describes what it is. In 3D facets are triangles. neighbours_ are indices of neighbouring facets in qh.facets_ array.