CGAL users discussion list

[Daniel Russel <>]

There is no kinetic convex hull data structure data structure in CGAL as, at the time of implementation, the best such algorithm was rather complicated.

As you surmised, extracting the convex hull from the delaunay triangulation works well in practice.

On Thu, Nov 3, 2011 at 8:06 AM, Karen Daniels <> wrote:

 Does anyone know if there exists a CGAL kinetic data structure for maintaining changes to a convex hull?  Or, is it possible to use, for this purpose,  the kinetic data structure for the Delaunay triangulation and the infinite vertex?

     - Karen Daniels

-------------------------------------------

Karen Daniels, Ph.D.
Associate Professor
Department of Computer Science
University of Massachusetts Lowell

One University Avenue
Olsen Hall, Room 216
Lowell, MA 01854

Phone: 978-934-3631
Fax: 978-934-3551
Email:
URL: http://www.cs.uml.edu/~kdaniels


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