SCG '86 Proceedings of the second annual symposium on Computational geometry
Voronoi diagrams and arrangements
Discrete & Computational Geometry
Randomized multidimensional search trees (extended abstract): dynamic sampling
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Algebraic specification of a 3D-modeler based on hypermaps
CVGIP: Graphical Models and Image Processing
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Robust adaptive floating-point geometric predicates
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the twelfth annual symposium on Computational geometry
Simple traversal of a subdivision without extra storage
Proceedings of the twelfth annual symposium on Computational geometry
A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
Proceedings of the fourteenth annual symposium on Computational geometry
Improved incremental randomized Delaunay triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
Interval arithmetic yields efficient dynamic filters for computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Checking the convexity of polytopes and the planarity of subdivision
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Using generic programming for designing a data structure for polyhedral surfaces
Computational Geometry: Theory and Applications - Special issue on applications and challenges
A point-placement strategy for conforming Delaunay tetrahedralization
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Centroidal Voronoi diagrams for isotropic surface remeshing
Graphical Models - Special issue on SMI 2003
Optimal succinct representations of planar maps
Proceedings of the twenty-second annual symposium on Computational geometry
The voronoi diagram of three lines
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
Computational Geometry: Theory and Applications
IEEE Transactions on Visualization and Computer Graphics
Point-cloud simplification with bounded geometric deviations
International Journal of Computer Applications in Technology
An experimental study of point location in planar arrangements in CGAL
Journal of Experimental Algorithmics (JEA)
Modelling three-dimensional geoscientific fields with the Voronoi diagram and its dual
International Journal of Geographical Information Science
Succinct representations of planar maps
Theoretical Computer Science
From Segmented Images to Good Quality Meshes Using Delaunay Refinement
Emerging Trends in Visual Computing
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Proceedings of the twenty-fifth annual symposium on Computational geometry
Parallel geometric algorithms for multi-core computers
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computer Aided Geometric Design
Filtering relocations on a Delaunay triangulation
SGP '09 Proceedings of the Symposium on Geometry Processing
Parallel geometric algorithms for multi-core computers
Computational Geometry: Theory and Applications
Exact geometric and algebraic computations in CGAL
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Constructing two-dimensional Voronoi diagrams via divide-and-conquer of envelopes in space
Transactions on computational science IX
Using Kendall-τ meta-bagging to improve protein-protein docking predictions
PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Succinct representation of triangulations with a boundary
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Multithread parallelization of Lepp-bisection algorithms
Applied Numerical Mathematics
Formal study of plane delaunay triangulation
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Explicit array-based compact data structures for triangulations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Flip-flop: convex hull construction via star-shaped polyhedron in 3D
Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
| Hi-index | 0.00 |
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library Cgal.