A 2D Delaunay Triangulation (DT) with incremental site insertion.
Points in Euclidean space, implemented as double.
A Simplex is an immutable set of vertices (usually Pnts).
A Triangulation on vertices (generic type V).
Algorithms for computing geometrical information about sets of points, such as the Delaunay triangulation and Voronoi tessellation.
Copyright © 2000-2002 Xerox Corporation. All Rights Reserved
Copyright © 2003 World Wide Web Consortium. All Rights Reserved
Copyright © 2004-2015 INRIA. All Rights Reserved
Licensed under the GNU LGPL. For full terms see the file COPYING.