Subject: CGAL users discussion list
List archive
- From: Mariette Yvinec <>
- To:
- Subject: [cgal-discuss] Minimum bounding n-corner
- Date: Fri, 27 May 2011 09:52:50 +0200
---------- Weitergeleitete Nachricht ----------
From:
thillsiq<>
To:
Date: Thu, 26 May 2011 08:56:48 -0700 (PDT)
Subject: Minimum bounding n-corner
Hi!
I am a complete newbie to CGAL and to most of Computational Geometry
Algorithms. By reading the online documentation I was not able to identify
if it is possible to build the Minimum bounding n-corner (or simply n-C) of
a polygon using the functions defined by CGAL. In fact, I would like to
build the 5-C conservative approximation, i.e., to define a 5 sided polygon
that circumscribes the orginal polygon, as shown in the attached figure (by
Brinkhoff, T. 1994).
Thanks in advance,
Thiago
http://cgal-discuss.949826.n4.nabble.com/file/n3552927/5-C.PNG 5-C.PNG
-----
Thiago Siqueira
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Minimum-bounding-n-corner-tp3552927p3552927.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Minimum bounding n-corner, Mariette Yvinec, 05/27/2011
- Re: [cgal-discuss] Minimum bounding n-corner, Sebastien Loriot (GeometryFactory), 05/31/2011
Archive powered by MHonArc 2.6.16.