2D triangulations

2D triangulations. CGAL User and Reference Manual: This package allows to build and handle various triangulations for point sets two dimensions. Any CGAL triangulation covers the convex hull of its vertices. Triangulations are built incrementally and can be modified by insertion or removal of vertices. They offer point location facilities. The package provides plain triangulation (whose faces depend on the insertion order of the vertices) and Delaunay triangulations. Regular triangulations are also provided for sets of weighted points. Delaunay and regular triangulations offer nearest neighbor queries and primitives to build the dual Voronoi and power diagrams. Finally, constrained and Delaunay constrained triangulations allows to force some constrained segments to appear as edges of the triangulation. Several versions of constrained and Delaunay constrained triangulations are provided: some of them handle intersections between input constraints segment while others do not.

References in zbMATH (referenced in 29 articles )

Showing results 1 to 20 of 29.
Sorted by year (citations)

1 2 next

  1. Ibanez, Dan; Shephard, Mark S.: Modifiable array data structures for mesh topology (2017)
  2. Lhuillier, Maxime: 2-manifold tests for 3D Delaunay triangulation-based surface reconstruction (2015)
  3. Nivoliers, Vincent; Lévy, Bruno; Geuzaine, Christophe: Anisotropic and feature sensitive triangular remeshing using normal lifting (2015)
  4. Alfonso, J.C.L.; Buttazzo, G.; García-Archilla, B.; Herrero, M.A.; Núñez, L.: Selecting radiotherapy dose distributions by means of constrained optimization problems (2014)
  5. Wachsmuth, Gerd: The numerical solution of Newton’s problem of least resistance (2014)
  6. De Castro, Pedro Machado Manhães; Devillers, Olivier: Practical distribution-sensitive point location in triangulations (2013)
  7. Demaret, Laurent; Iske, Armin; Khachabi, Wahid: Sparse representation of video data by adaptive tetrahedralizations (2012)
  8. Loubes, Jean-Michel; Rochet, Paul: Regularization with approximated $L^2$ maximum entropy method (2012)
  9. Rivara, Maria-Cecilia; Rodriguez, Pedro; Montenegro, Rafael; Jorquera, Gaston: Multithread parallelization of LEPP-bisection algorithms (2012)
  10. Castelli Aleardi, Luca; Devillers, Olivier: Explicit array-based compact data structures for triangulations (2011)
  11. Siek, Jeremy G.; Lumsdaine, Andrew: A language for generic programming in the large (2011)
  12. Batista, Vicente H.F.; Millman, David L.; Pion, Sylvain; Singler, Johannes: Parallel geometric algorithms for multi-core computers (2010)
  13. Dufourd, Jean-François; Bertot, Yves: Formal study of plane Delaunay triangulation (2010)
  14. Lewiner, Thomas; Lopes, Hélio; Medeiros, Esdras; Tavares, Geovan; Velho, Luiz: Topological mesh operators (2010)
  15. Setter, Ophir; Sharir, Micha; Halperin, Dan: Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space (2010)
  16. Everett, Hazel; Lazard, Daniel; Lazard, Sylvain; Safey El Din, Mohab: The Voronoi diagram of three lines (2009)
  17. Haran, Idit; Halperin, Dan: An experimental study of point location in planar arrangements in CGAL (2009)
  18. Aleardi, L.Castelli; Devillers, O.; Schaeffer, G.: Succinct representations of planar maps (2008)
  19. Bandyopadhyay, Deepak; Snoeyink, Jack: Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL (2007)
  20. Bíscaro, Helton Hideraldo; Filho, Antonio Castelo; Nonato, Luis Gustavo; Ferreira de Olivira, Maria Cristina: A topological approach for surface reconstruction from sample points (2007) ioport

1 2 next