CGAL users discussion list

[BBB HHH <>]

Hi,

Thanks for your answer. At the best of my knowledge, the convex decomposition package of CGAL works only for polygons that do not contain holes. Can you tell me if this is true or not?

I will try to use the constrained Delaunay triangulation of CGAL.

Thanks
Hichem Barki
Ph.D. student
LIRIS Laboratory
http://liris.cnrs.fr/m2disco

---

De : Laurent Rineau (GeometryFactory) <>
À :
Envoyé le : Jeudi, 5 Mars 2009, 15h01mn 16s
Objet : Re: [cgal-discuss] Triangulation of a Polygon_with_holes_2 without introducing Steiner points

On Thursday 05 March 2009 14:59:23 Laurent Rineau (GeometryFactory) wrote:
> On Thursday 05 March 2009 14:54:25 BBB HHH wrote:
> > Hello every one,
> >
> >
> > I want to triangulate a Polygon_without_holes_2. Moreover, i want to do
> > it without introducing Steiner (new) points.
> >
> >
> > Is there a mean to do that within CGAL ?
>
> First remark: that has nothing to do with Jet_fitting_3, which was the
> first subject of the thread. You should have started a new thread, instead
> of replying to a message.
>
> If you want to triangulate a 2D polygon, without Steiner points, you can
> use the convex decomposition package of CGAL, and then simply triangulate
> your convex parts as you want (choose a vertex, and then star the convex
> part from that vertex).

Forgot my advice! There is better: just use the 2D constrained Delaunay
triangulation of CGAL, with your polygon edges as constraints.

--
Laurent Rineau, PhD
Engineer at GeometryFactory
http://www.geometryfactory.com/

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