CGAL users discussion list

[Panagiotis Foteinos <>]

You can find information about the infinite vertex and infinite faces in the manual under triangulations. It is a technique that allows for more flexible data structure; there is no physical meaning.

You do not traverse the faces with an iterator. I did not say that. 

You will start from a facet, say f, that lies inside the hole you wanna delete (there is a query for that), and then you will traverse the neighbors of f, and then its neighbors' neighbors (using indices), only if (a) you do not traverse a facet twice, and (b) the neighbors are not separated by a constrained edge (since otherwise you traverse a facet outside the hole). Of course, every time you visit a face you tag it as "outside" using face_base_with_info class. When you output your triangulation at the end, you ignore faces that are tagged as "outside".

On Fri, Feb 12, 2010 at 10:13 AM, Agnel C J Kurian <> wrote:

Panagiotis,

I understand that I can traverse all faces using a face iterator. But how do I
test a face against a constraint? And where can I read more about this elusive
"infinite vertex"?

--

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