CGAL users discussion list

[Adam Hopkins <>]

Hi Andreas:

Thank you for your answer and your solutions seem perfect. But, could you send me a short code to see the best way to do this? because there are different iterators (all_cells_iterator, finite_cells_iterator, etc) and I do not know how I can implement your solution (what are the involved methods and what kind of elements do I need to iterate?). While, on the other hand I also need to know which are the vertexs of the external faces. Will be perfect if you can send me an example for solve these problems.

thanks a lot

A.

On Mon, Jan 23, 2012 at 4:03 PM, Andreas Fabri <> wrote:

On 23/01/2012 15:39, Adam Hopkins wrote:

Hi All:

I have a set of points in the three dimentional space, where a
triangulation using CGAL library was computed. How Can I know which are
the most external tetrahedrons? is to say, the tetrahedrons which have
at least one external face. Are there functions or any form to know
that? Is possible to iterate only these kind of elements?

thanks
A.

Hi Adam,

For all cells incident to the infinite vertex,
take the cell opposite to the infinite vertex.

andreas

--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss