Skip to Main content Skip to Navigation


...
hal-00961390v1  Journal articles
Mikhail BogdanovOlivier DevillersMonique Teillaud. Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2014, 5 (1), pp.56-85. ⟨10.20382/jocg.v5i1a4⟩
...
hal-01586511v1  Journal articles
Olivier DevillersMenelaos KaravelasMonique Teillaud. Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2017, 8 (1), pp.282--315. ⟨10.20382/jocg.v8i1a11⟩
...
hal-01959590v1  Journal articles
Luca Castelli AleardiOlivier DevillersEric Fusy. Canonical Ordering for Graphs on the Cylinder with Applications to Periodic Straight-line Drawings on the Flat Cylinder and Torus
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2018, 9 (1), pp.391 - 429. ⟨10.20382/jocg.v9i1a14⟩
...
hal-01285120v1  Journal articles
Olivier DevillersMarc GlisseXavier GoaocRémy Thomasse. Smoothed complexity of convex hulls by witnesses and collectors
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (2), pp.101-144. ⟨10.20382/jocg.v7i2a6⟩
...
inria-00595823v1  Journal articles
Olivier Devillers. Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2011, 2 (1), pp.30-45. ⟨10.20382/jocg.v2i1a3⟩
...
hal-01348831v1  Journal articles
Olivier DevillersRoss Hemsley. The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.332-359. ⟨10.20382/jocg.v7i1a16⟩
...
hal-01846652v1  Journal articles
Luca Castelli AleardiOlivier Devillers. Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2018, 9 (1), pp.247-289. ⟨10.20382/jocg.v9i1a8⟩
hal-01180166v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersMonique Teillaud. An on-line construction of higher-order Voronoi diagrams and its randomized analysis
Canadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281
...
inria-00348713v1  Conference papers
Jean-Daniel BoissonnatFrédéric CazalsTran Kai Frank DaOlivier DevillersSylvain Pion et al.  Programming with CGAL: the example of triangulations
8th Annual Video Review of Computational Geometry, 15th ACM Symposium on Computational Geometry (SCG), Jun 1999, Miami Beach, Florida, United States
...
inria-00099449v1  Conference papers
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  On the Number of Lines Tangent to Four Convex Polyhedra
14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
...
hal-00795075v1  Journal articles
Jean-Daniel BoissonnatAndré CerezoOlivier DevillersMonique Teillaud. Output-sensitive construction of the Delaunay triangulation of points lying in two planes
International Journal of Computational Geometry and Applications, World Scientific Publishing, 1996, 6 (1), pp.1-14. ⟨10.1142/S0218195996000022⟩
...
inria-00442776v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersSylvain Lazard. From spider robots to half disk robots
IEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958
...
inria-00000374v1  Conference papers
Olivier DevillersHazel EverettSylvain LazardMaria PentchevaStephen Wismath. Drawing $K_n$ in Three Dimensions with One Bend per Edge
13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland