CGAL users discussion list

[Andreas Fabri <>]

Wesley Smith wrote:
> > Then you will se that entire R^3 gets triangulated which
> > means that there is one additional tetrahedron per face
> > of the convex hull that has as fourth vertex the, unique,
> > infinite vertex.
>
> Thanks for pointing this out.  I've been reading through the manual
> and reference manual quite thoroughly but haven't found a way to
> filter these out.  Is there a function such as is_infinite for the
> cells?  I don't see anything like this.  I just need a simple test for
> this.  Any help is greatly appreciated.

ok, so my rtfm doesn't apply here ==:>-


As we use derivation, much of the functionality of the Delaunay
triangulation is documented in the base class Triangulation_2

Go to section "Refines" and click.

Note that even this class has a further base class.

Some of the documentation is also in the Vertex and Cell class.

Also note that there is a user manual which explains things
and gives examples, and the reference manual which is just the
documentation of the API.

best,

andreas


> thanks,
> wes