|
||
---|---|---|
hal-02195880v1
Conference papers
Three Dimensional Triangulations in Cgal Abstracts 15th European Workshop on Computational Geometry, 1999, Antibes, France |
||
hal-01801136v1
Conference papers
Delaunay triangulations of regular hyperbolic surfaces 9th International Conference on Curves and Surfaces, Jun 2018, Arcachon, France |
||
hal-01803443v1
Conference papers
Systole of regular hyperbolic surfaces with an application to Delaunay triangulations 9th International Conference on Curves and Surfaces, Jun 2018, Arcachon, France |
||
inria-00350878v1
Conference papers
The Offset to an Algebraic Curve and an Application to Conics International Conference on Computational Science and its Applications, May 2005, Singapore, Singapore. pp.683-696 |
||
hal-00850586v1
Conference papers
Hyperbolic Delaunay triangulations and Voronoi diagrams made practical XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain |
||
inria-00090522v2
Reports
Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations [Research Report] RR-5968, INRIA. 2006, pp.11 |
||
hal-00592685v1
Conference papers
CGAL - The Computational Geometry Algorithms Library 10e colloque national en calcul des structures, May 2011, Giens, France. pp.6 |
||
hal-01294409v1
Journal articles
Delaunay triangulations of closed Euclidean d-orbifolds Discrete and Computational Geometry, Springer Verlag, 2016, 55 (4), pp.827--853. ⟨10.1007/s00454-016-9782-6⟩ |
||
inria-00090675v1
Journal articles
Applications of random sampling to on-line algorithms in computational geometry Discrete and Computational Geometry, Springer Verlag, 1992, 8 (1), pp.51--71. ⟨10.1007/BF02293035⟩ |
||
hal-00833760v1
Conference papers
Complexity Analysis of Random Geometric Structures Made Simpler Proceedings of the 29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩ |
||
inria-00506017v1
Reports
Delaunay Triangulations of Point Sets in Closed Euclidean d-Manifolds [Research Report] RR-7352, INRIA. 2010 |
||
hal-01179408v1
Conference papers
Triangulations in CGAL Proceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.11-18, ⟨10.1145/336154.336165⟩ |
||
hal-01179450v1
Conference papers
Computing the Maximum Overlap of Two Convex Polygons Under Translations International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135 |
||
hal-01179417v1
Conference papers
Algebraic methods and arithmetic filtering for exact predicates on circle arcs Proceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.139-147, ⟨10.1145/336154.336194⟩ ![]() |
||
hal-01179401v1
Conference papers
Splitting a Delaunay Triangulation in Linear Time Proceedings of the 8th European Symposium on Algorithms, 2001, Aarhus, Denmark. pp.312-320, ⟨10.1007/3-540-44676-1_26⟩ |
||
inria-00075003v1
Reports
Dynamic location in an arrangement of line segments in the plane [Research Report] RR-1558, INRIA. 1991 |
||
inria-00074941v1
Reports
The space of spheres, a geometric tool to unify duality results on Voronoi diagrams [Research Report] RR-1620, INRIA. 1992 |
||
inria-00350858v1
Journal articles
On the Computation of an Arrangement of Quadrics in 3D Computational Geometry, Elsevier, 2005, 30 (2), pp.145-164. ⟨10.1016/j.comgeo.2004.05.003⟩ |
||
inria-00090678v1
Journal articles
Fully dynamic Delaunay triangulation in logarithmic expected time per operation Computational Geometry, Elsevier, 1992, 2 (2), pp.55--80. ⟨10.1016/0925-7721(92)90025-N⟩ |
||
inria-00166709v1
Journal articles
Algebraic methods and arithmetic filtering for exact predicates on circle arcs Computational Geometry, Elsevier, 2002, 22, pp.119-142. ⟨10.1016/S0925-7721(01)00050-5⟩ |
||
inria-00560388v1
Journal articles
Perturbations for Delaunay and weighted Delaunay 3D Triangulations Computational Geometry, Elsevier, 2011, 44, pp.160--168. ⟨10.1016/j.comgeo.2010.09.010⟩ |
||
inria-00167199v1
Journal articles
Triangulations in CGAL Computational Geometry, Elsevier, 2002, 22, pp.5-19. ⟨10.1016/S0925-7721(01)00054-2⟩ |
||
inria-00071961v1
Reports
Perturbations and Vertex Removal in a 3D Delaunay Triangulation RR-4624, INRIA. 2002 |
||
hal-00919177v1
Reports
A Generic Implementation of dD Combinatorial Maps in CGAL [Research Report] RR-8427, INRIA. 2013 |
||
hal-01101044v1
Directions of work or proceedings
Proceedings of Computational Geometry (Dagstuhl Seminar 11111) Pankaj Kumar Agarwal; Kurt Mehlhorn; Monique Teillaud. Mar 2011, Germany. ⟨Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik⟩, 2011, ⟨10.4230/DagRep.1.3.19⟩ |
||
hal-01101063v1
Conference papers
The sticky geometry of the cosmic web SoCG 2012 - 28th Annual Symposium on Computational Geometry, Jun 2012, Chapel Hill, United States. pp.421-422, ⟨10.1145/2261250.2261316⟩ ![]() |
||
hal-01053388v1
Book sections
Generic Programming and The CGAL Library Jean-Daniel Boissonnat and Monique Teillaud. Effective Computational Geometry for Curves and Surfaces, Springer Verlag, pp.313-320, 2006, Mathematics and Visualization, 978-3-540-33259-6 |
||
inria-00413506v1
Journal articles
Dynamic location in an arrangement of line segments in the plane Algorithms Review, ALCOM EC project, 1992, 2 (3), pp.89-103 |
||
|