Skip to Main content Skip to Navigation


...
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⟩
...
inria-00090638v1  Journal articles
Olivier Devillers. The Number of Cylindrical Shells
Discrete and Computational Geometry, Springer Verlag, 2003, 30 (3), pp.453-458. ⟨10.1007/s00454-003-2818-8⟩
...
inria-00090653v1  Journal articles
Olivier DevillersFranco Preparata. A probabilistic analysis of the power of arithmetic filters
Discrete and Computational Geometry, Springer Verlag, 1998, 20 (4), pp.523--547. ⟨10.1007/PL00009400⟩
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-00001187v1  Conference papers
Luca Castelli AleardiOlivier DevillersGilles Schaeffer. Dynamic updates of succinct triangulations
18th Canadian Conference on Computational Geometry, 2005, Windsor, Canada, France
...
inria-00098669v1  Conference papers
Luca Castelli AleardiOlivier DevillersGilles Schaeffer. Optimal Succinct Representations of Planar Maps
Proceedings of the 22nd Annual Symposium on Computational Geometry, Jun 2006, Sedona, Arizona, United States. ⟨10.1145/1137856.1137902⟩
...
hal-01384396v2  Journal articles
Dominique AttaliOlivier DevillersMarc GlisseSylvain Lazard. Recognizing Shrinkable Complexes Is NP-Complete
Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩
...
hal-03031995v1  Reports
Otfried CheongOlivier DevillersMarc GlisseJi-Won Park. Covering families of triangles
[Research Report] RR-9378, INRIA. 2020, pp.31
...
hal-01712628v1  Journal articles
Olivier DevillersLouis Noizet. Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2018, 28 (3), pp.255-269. ⟨10.1142/S0218195918500061⟩
...
hal-01015747v1  Conference papers
Dominique AttaliOlivier DevillersMarc GlisseSylvain Lazard. Recognizing shrinkable complexes is NP-complete
Proceedings of the 22nd European Symposium on Algorithms, 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩
hal-01179417v1  Conference papers
Olivier DevillersAlexandra FronvilleBernard MourrainMonique Teillaud. 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-00850588v1  Conference papers
Luca Castelli AleardiOlivier Devillers. Explicit array-based compact data structures for planar and surface meshes
XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain
hal-01179898v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersLeonbattista DonatiFranco Preparata. Motion planning for a spider robot
IEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326
hal-01179691v1  Conference papers
Olivier DevillersGiuseppe LiottaFranco PreparataRoberto Tamassia. Checking the convexity of polytopes and the planarity of subdivisions
Workshop Algorithms and Data Structures, 1997, Halifax, Canada. pp.186-199
hal-01180164v1  Conference papers
Olivier DevillersStefan MeiserMonique Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Workshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53
...
hal-01568030v1  Reports
Olivier DevillersMarc Glisse. Delaunay triangulation of a random sample of a good sample has linear size
[Research Report] RR-9082, Inria Saclay Ile de France; Inria Nancy - Grand Est. 2017, pp.6
hal-01180157v1  Conference papers
Olivier DevillersStefan MeiserMonique Teillaud. The space of spheres, a geometric tool to unify duality results on Voronoi diagrams
Canadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.263-268
hal-01179450v1  Conference papers
Mark De BergOlivier DevillersMarc Van KreveldOtfried SchwarzkopfMonique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations
International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135
...
hal-00678615v1  Conference papers
Luca Castelli AleardiOlivier Devillers. Explicit array-based compact data structures for triangulations
22nd International Symposium on Algorithms and Computation, 2011, Yokohama, Japan. pp.312--322
...
inria-00412352v1  Conference papers
Oswin AichholzerFranz AurenhammerOlivier DevillersThomas HacklMonique Teillaud et al.  Lower and upper bounds on the number of empty cylinders and ellipsoids
European Workshop on Computational Geometry, Mar 2009, Bruxelles, Belgium. pp.139-142
hal-01179468v1  Conference papers
Jean-Daniel BoissonnatJurek CzyzowiczOlivier DevillersMariette Yvinec. Circular separability of polygon
Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281
...
inria-00090707v1  Conference papers
Luca Castelli AleardiOlivier DevillersGilles Schaeffer. Succinct representation of triangulations with a boundary
9th Workshop on Algorithms and Data Structures, Aug 2005, Waterloo, Canada, pp.134--135
...
hal-01698928v1  Reports
Olivier DevillersSylvain LazardWilliam Lenhart. 3D Snap Rounding
[Research Report] RR-9149, Inria Nancy - Grand Est. 2018, pp.1-22