CGAL users discussion list

[Monique Teillaud <>]

And additional vertices will be introduced by the CGAL package when needed.

--
Monique Teillaud
http://www.inria.fr/sophia/members/Monique.Teillaud/
INRIA Sophia Antipolis - Méditerranée
Institut National de Recherche en Informatique et Automatique

Le 08/09/14 10:44, Andreas Fabri a écrit :
> It is also known that it is possible for quite some polyhedra.
> Tetgen does this, and CGAL will offer this soon too.
>
> andreas
>
> On 08/09/2014 10:14, Monique Teillaud wrote:
> > It is known that there are polyhedra for which it is impossible, unless
> > vertices are added.
> >
> > See http://en.wikipedia.org/wiki/Sch%C3%B6nhardt_polyhedron
> > "In geometry, the Schönhardt polyhedron is the simplest non-convex
> > polyhedron that cannot be triangulated into tetrahedra without adding
> > new vertices."
> >
> > --
> > Monique Teillaud
> > http://www.inria.fr/sophia/members/Monique.Teillaud/
> > INRIA Sophia Antipolis - Méditerranée
> > Institut National de Recherche en Informatique et Automatique
> >
> > Le 08/09/14 01:12, erocha.ssa a écrit :
> > > How can I decompose a polyhedron (CGAL::Polyhedron_3) into a set of
> > > tetrahedra ? Sorry, if this question has been asked before, but I
> > > couldn't
> > > find any answer googleing it. Pointer to any documentation will be
> > > very much
> > > appreciated.
> > > Thanks in advance
> > >
> > >
> > >
> > > --
> > > View this message in context:
> > > http://cgal-discuss.949826.n4.nabble.com/Decompose-polyhedron-into-tetrahedron-tp4659800.html
> > >
> > >
> > > Sent from the cgal-discuss mailing list archive at Nabble.com.