Access content directly

# Olivier Devillers

306
Documents
Researcher identifiers

## Presentation

[my homepage](https://members.loria.fr/Olivier.Devillers/),[ ![ORCID iD icon](https://orcid.org/sites/default/files/images/orcid_16x16.png)orcid](https://orcid.org/0000-0003-4275-5068) ### ### **PhD student**s - Charles Duménil. [Expected Size of the 3-Dimensional Delaunay Triangulation of Random Points on a Surface](https://tel.archives-ouvertes.fr/tel-03695908). 2022. - Rémy Thomasse. [Complexity analysis of random convex hulls](https://tel.archives-ouvertes.fr/tel-01252937). 2015. - Ross Hemsley. [Probabilistic methods for the analysis of algorithms on random tessellations,](https://tel.archives-ouvertes.fr/tel-01099165) 2014. - Pedro Machado Manhães de Castro. [Practical Ways to Accelerate Delaunay Triangulations.](http://tel.archives-ouvertes.fr/tel-00531765/fr/) 2010. - Abdelkrim Mebarki. [Implantation de structures de données compactes pour les triangulations](http://tel.archives-ouvertes.fr/tel-00336178/). 2008. - Luca Castelli Aleardi. [Représentations compactes de structures de données géométriques.](http://tel.archives-ouvertes.fr/tel-00336188/) 2006. - Philippe Guigue. [Constructions géométriques à précision fixée](http://tel.archives-ouvertes.fr/tel-00471447/fr/). 2003. - Pierre-Marie Gandoin. [Compression progressive sans perte de structures géométriques](http://tel.archives-ouvertes.fr/tel-00771344). 2001. - Pascal Desnoguès. [Triangulations et quadriques](http://tel.archives-ouvertes.fr/tel-00771335). 1996.

## Publications

### Covering families of triangles

Periodica Mathematica Hungarica, In press, ⟨10.1007/s10998-022-00503-4⟩
Journal articles

### Variable-width contouring for additive manufacturing

ACM Transactions on Graphics, 2020, 39 (4 (Proc. SIGGRAPH)), ⟨10.1145/3386569.3392448⟩
Journal articles

### Randomized incremental construction of Delaunay triangulations of nice point sets

Discrete and Computational Geometry, 2020, 64, pp.33. ⟨10.1007/s00454-020-00235-7⟩
Journal articles

### Rounding meshes in 3D

Discrete and Computational Geometry, 2020, 64 (1), pp.32--67. ⟨10.1007/s00454-020-00202-2⟩
Journal articles

### Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs

Journal of Computational Geometry, 2020, 11 (1), pp.212 - 234. ⟨10.20382/jocg.v11i1a9⟩
Journal articles

### Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$

Discrete Mathematics and Theoretical Computer Science, 2018, Vol. 20 no. 1 (1), pp.1-11. ⟨10.23638/DMTCS-20-1-1⟩
Journal articles

### Stretch Factor in a Planar Poisson-Delaunay Triangulation with a Large Intensity

Advances in Applied Probability, 2018, 50 (1), pp.35-56. ⟨10.1017/apr.2018.3⟩
Journal articles

### Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees

Journal of Computational Geometry, 2018, 9 (1), pp.247-289. ⟨10.20382/jocg.v9i1a8⟩
Journal articles

### Celestial Walk: A Terminating, Memoryless Walk for Convex Subdivisions

Journal of Computer Graphics Techniques, 2018, 7 (3), pp.29-49
Journal articles

### Canonical Ordering for Graphs on the Cylinder with Applications to Periodic Straight-line Drawings on the Flat Cylinder and Torus

Journal of Computational Geometry, 2018, 9 (1), pp.391 - 429. ⟨10.20382/jocg.v9i1a14⟩
Journal articles

### Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path

International Journal of Computational Geometry and Applications, 2018, 28 (3), pp.255-269. ⟨10.1142/S0218195918500061⟩
Journal articles

### Expected Length of the Voronoi Path in a High Dimensional Poisson-Delaunay Triangulation

Discrete and Computational Geometry, 2018, 60 (1), pp.200--219. ⟨10.1007/s00454-017-9866-y⟩
Journal articles

### Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework

Journal of Computational Geometry, 2017, 8 (1), pp.282--315. ⟨10.20382/jocg.v8i1a11⟩
Journal articles

### Recognizing Shrinkable Complexes Is NP-Complete

Journal of Computational Geometry, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩
Journal articles

### The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$

Journal of Computational Geometry, 2016, 7 (1), pp.332-359. ⟨10.20382/jocg.v7i1a16⟩
Journal articles

### Efficiently navigating a random Delaunay triangulation

Random Structures and Algorithms, 2016, 49 (1), pp.95--136. ⟨10.1002/rsa.20630⟩
Journal articles

### Smoothed complexity of convex hulls by witnesses and collectors

Journal of Computational Geometry, 2016, 7 (2), pp.101-144. ⟨10.20382/jocg.v7i2a6⟩
Journal articles

### Homological Reconstruction and Simplification in R3

Computational Geometry, 2015, 48 (8), pp.606-621. ⟨10.1016/j.comgeo.2014.08.010⟩
Journal articles

### Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical

Journal of Computational Geometry, 2014, 5 (1), pp.56-85. ⟨10.20382/jocg.v5i1a4⟩
Journal articles

### The monotonicity of $f$-vectors of random polytopes

Electronic Communications in Probability, 2013, 18 (23), pp.1-8. ⟨10.1214/ECP.v18-2469⟩
Journal articles

### Practical Distribution-Sensitive Point Location in Triangulations

Computer Aided Geometric Design, 2013, 30, pp.431-450. ⟨10.1016/j.cagd.2013.02.004⟩
Journal articles

### Oja centers and centers of gravity

Computational Geometry, 2013, 46 (2), pp.140-147. ⟨10.1016/j.comgeo.2012.04.004⟩
Journal articles

### A tight bound for the Delaunay triangulation of points on a polyhedron

Discrete and Computational Geometry, 2012, 48 (1), pp.19-38. ⟨10.1007/s00454-012-9415-7⟩
Journal articles

### Perturbations for Delaunay and weighted Delaunay 3D Triangulations

Computational Geometry, 2011, 44, pp.160--168. ⟨10.1016/j.comgeo.2010.09.010⟩
Journal articles

### Catalog Based Representation of 2D triangulations

International Journal of Computational Geometry and Applications, 2011, 21 (4), pp.393-402. ⟨10.1142/S021819591100372X⟩
Journal articles

### Vertex Removal in Two Dimensional Delaunay Triangulation: Speed-up by Low Degrees Optimization

Computational Geometry, 2011, 44, pp.169-177. ⟨10.1016/j.comgeo.2010.10.001⟩
Journal articles

### Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time

Journal of Computational Geometry, 2011, 2 (1), pp.30-45. ⟨10.20382/jocg.v2i1a3⟩
Journal articles

### On the Size of Some Trees Embedded in ${\mathbb R}^d$

Operations Research Letters, 2011, 39, pp.44-48. ⟨10.1016/j.orl.2010.10.005⟩
Journal articles

### 2D Centroidal Voronoi Tessellations with Constraints

Numerical mathematics : a journal of Chinese universities, 2010, 3 (2), pp.212--222. ⟨10.4208/nmtma.2010.32s.6⟩
Journal articles

### Helly-type theorems for approximate covering

Discrete and Computational Geometry, 2009, 42 (3), pp.379--398. ⟨10.1007/s00454-009-9167-1⟩
Journal articles

### Filtering Relocations on a Delaunay Triangulation

Computer Graphics Forum, 2009, ⟨10.1111/j.1467-8659.2009.01523.x⟩
Journal articles

### On the Complexity of Umbra and Penumbra

Computational Geometry, 2009, 42 (8), pp.758--771. ⟨10.1016/j.comgeo.2008.04.007⟩
Journal articles

### Succinct representations of planar maps

Theoretical Computer Science, 2008, Excursions in Algorithmics: A Collection of Papers in Honor of Franco P. Preparata, 408 (2-3), pp.174-187. ⟨10.1016/j.tcs.2008.08.016⟩
Journal articles

### Lines tangent to four triangles in three-dimensional space

Discrete and Computational Geometry, 2007, 37 (3), pp.369-380. ⟨10.1007/s00454-006-1278-3⟩
Journal articles

### Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint

International Journal of Computational Geometry and Applications, 2007, 17 (4), pp.297-304. ⟨10.1142/S0218195907002343⟩
Journal articles

### Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra

SIAM Journal on Computing, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
Journal articles

### Drawing Kn in Three Dimensions with One Bend per Edge

Journal of Graph Algorithms and Applications, 2006, 10 (2), pp.287-295
Journal articles

### Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions

Computational Geometry, 2006, 33, pp.3--17. ⟨10.1016/j.comgeo.2004.08.005⟩
Journal articles

### Un joli algorithme géométrique et ses vilains problèmes numériques

Interstices, 2006, pp.~
Journal articles

### Centroidal Voronoi diagrams for isotropic surface remeshing

Graphical Models, 2005, 67 (3), pp.204-231. ⟨10.1016/j.gmod.2004.06.007⟩
Journal articles

### The Number of Cylindrical Shells

Discrete and Computational Geometry, 2003, 30 (3), pp.453-458. ⟨10.1007/s00454-003-2818-8⟩
Journal articles

### Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position

Computational Geometry, 2003, 26, pp.193-208. ⟨10.1016/S0925-7721(03)00013-0⟩
Journal articles

### Culling a Set of Points for Roundness or Cylindricity Evaluations

International Journal of Computational Geometry and Applications, 2003, 13, pp.231-240. ⟨10.1142/S021819590300113X⟩
Journal articles

### Anisotropic Polygonal Remeshing

ACM Transactions on Graphics, 2003, 22 (3), pp.485-493. ⟨10.1145/1201775.882296⟩
Journal articles

### Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates

Journal of graphics tools, 2003, 8 (1), pp.39-52. ⟨10.1080/10867651.2003.10487580⟩
Journal articles

### Minimal set of constraints for 2D constrained Delaunay reconstruction

International Journal of Computational Geometry and Applications, 2003, 13 (5), pp.391-398. ⟨10.1142/S0218195903001244⟩
Journal articles

### The expected number of 3D visibility events is linear

SIAM Journal on Computing, 2003, 32 (6), pp.1586-1620. ⟨10.1137/S0097539702419662⟩
Journal articles

### The Delaunay Hierarchy

International Journal of Foundations of Computer Science, 2002, 13, pp.163-180. ⟨10.1142/S0129054102001035⟩
Journal articles

### Computing Roundness is Easy if the Set is Almost Round

International Journal of Computational Geometry and Applications, 2002, 12 (3), pp.229-248. ⟨10.1142/S0218195902000840⟩
Journal articles

### Algebraic methods and arithmetic filtering for exact predicates on circle arcs

Computational Geometry, 2002, 22, pp.119-142. ⟨10.1016/S0925-7721(01)00050-5⟩
Journal articles

### Circular Cylinders by Four or Five Points in Space

Discrete and Computational Geometry, 2002, 29 (1), pp.83--104. ⟨10.1007/s00454-002-2811-7⟩
Journal articles

### Splitting a Delaunay Triangulation in Linear Time

Algorithmica, 2002, 34 (1), pp.39--46. ⟨10.1007/s00453-002-0939-8⟩
Journal articles

### Rounding Voronoi Diagram

Theoretical Computer Science, 2002, 283 (1), pp.203--221. ⟨10.1016/S0304-3975(01)00076-7⟩
Journal articles

### Progressive Lossless Compression of Arbitrary Simplicial Complexes

ACM Transactions on Graphics, 2002, 21 (Siggraph'2002 Conference proceedings), pp.372-379. ⟨10.1145/566654.566591⟩
Journal articles

### Walking in a Triangulation

International Journal of Foundations of Computer Science, 2002, 13, pp.181--199. ⟨10.1142/S0129054102001047⟩
Journal articles

### On Deletion in Delaunay Triangulations

International Journal of Computational Geometry and Applications, 2002, 12, pp.193-205. ⟨10.1142/S0218195902000815⟩
Journal articles

### Triangulations in CGAL

Computational Geometry, 2002, 22, pp.5-19. ⟨10.1016/S0925-7721(01)00054-2⟩
Journal articles

### The shuffling buffer

International Journal of Computational Geometry and Applications, 2001, 11, pp.555-572. ⟨10.1142/S021819590100064X⟩
Journal articles

### Circular Separability of Polygons

Algorithmica, 2001, 30 (1), pp.67--82. ⟨10.1007/s004530010078⟩
Journal articles

### Removing degeneracies by perturbing the problem or perturbing the world

Reliable Computing, 2000, ⟨10.1023/A:1009942427413⟩
Journal articles

### Computing Largest Circles Separating Two Sets of Segments

International Journal of Computational Geometry and Applications, 2000, 10, pp.41--54. ⟨10.1142/S0218195900000036⟩
Journal articles

### Motion planning of legged robots

SIAM Journal on Computing, 2000, 30 (1), pp.218-246. ⟨10.1137/S0097539797326289⟩
Journal articles

### Finding an ordinary conic and an ordinary hyperplane

Nordic Journal of Computing, 1999, 6, pp.462-468
Journal articles

### Optimal Line Bipartitions of Point Sets

International Journal of Computational Geometry and Applications, 1999, 9 (1), pp.39-51. ⟨10.1142/S0218195999000042⟩
Journal articles

### Further Results on Arithmetic Filters for Geometric Predicates

Computational Geometry, 1999, 13, pp.141-148. ⟨10.1016/S0925-7721(99)00011-5⟩
Journal articles

### Convex Tours of Bounded Curvature.

Computational Geometry, 1999, 13, pp.149-160. ⟨10.1016/S0925-7721(99)00022-X⟩
Journal articles

### Dog bites postman: point location in the moving Voronoi diagram and related problems

International Journal of Computational Geometry and Applications, 1998, 8 (3), pp.321-342. ⟨10.1142/S0218195998000163⟩
Journal articles

### Computing the Maximum Overlap of Two Convex Polygons Under Translations.

Theory of Computing Systems, 1998, 31, pp.613-628. ⟨10.1007/PL00005845⟩
Journal articles

### A probabilistic analysis of the power of arithmetic filters

Discrete and Computational Geometry, 1998, 20 (4), pp.523--547. ⟨10.1007/PL00009400⟩
Journal articles

### Checking the convexity of polytopes and the planarity of subdivisions.

Computational Geometry, 1998, 11, pp.187-208. ⟨10.1016/S0925-7721(98)00039-X⟩
Journal articles

### Computing a single cell in the union of two simple polygons

Information Processing Letters, 1997, 63, pp.215-219. ⟨10.1016/S0020-0190(97)00125-7⟩
Journal articles

### Evaluating signs of determinants using single-precision arithmeti

Algorithmica, 1997, 17 (2), pp.111-132. ⟨10.1007/BF02522822⟩
Journal articles

### Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers

International Journal of Computational Geometry and Applications, 1996, 6 (4), pp.487-506. ⟨10.1142/S0218195996000307⟩
Journal articles

### Queries on Voronoi Diagrams of Moving Points

Computational Geometry, 1996, 6, pp.315-327. ⟨10.1016/0925-7721(95)00053-4⟩
Journal articles

### Output-sensitive construction of the Delaunay triangulation of points lying in two planes

International Journal of Computational Geometry and Applications, 1996, 6 (1), pp.1-14. ⟨10.1142/S0218195996000022⟩
Journal articles

### An Introduction to Randomization in Computational Geometry.

Theoretical Computer Science, 1996, 157, pp.35-52. ⟨10.1016/0304-3975(95)00174-3⟩
Journal articles

### An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d

Computational Geometry, 1996, 6, pp.123-130. ⟨10.1016/0925-7721(95)00024-0⟩
Journal articles

### Motion planning of legged robots: the spider robot problem

International Journal of Computational Geometry and Applications, 1995, 5 (1), pp.3-20. ⟨10.1142/S0218195995000027⟩
Journal articles

### Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas

Information Processing Letters, 1995, 56 (3), pp.157-164. ⟨10.1016/0020-0190(95)00132-V⟩
Journal articles

### Computing Connolly surfaces

Journal of molecular graphics, 1994, 12 (1), pp.61-62. ⟨10.1016/0263-7855(94)80033-2⟩
Journal articles

### A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis

Algorithmica, 1993, 9 (4), pp.329-356. ⟨10.1007/BF01228508⟩
Journal articles

### Simultaneous Containment of Several Polygons: Analysis of the Contact Configurations

International Journal of Computational Geometry and Applications, 1993, 3 (4), pp.429-442. ⟨10.1142/S0218195993000270⟩
Journal articles

### Dynamic location in an arrangement of line segments in the plane

Algorithms Review - newsletter of the ESPRIT II Basic Research Action Project no. 3075 (ALCOM) , 1992, 2 (3), pp.89-103
Journal articles

### Fully dynamic Delaunay triangulation in logarithmic expected time per operation

Computational Geometry, 1992, 2 (2), pp.55--80. ⟨10.1016/0925-7721(92)90025-N⟩
Journal articles

### Randomization Yields Simple $O(n \log^{\star} n)$ Algorithms for Difficult $\Omega(n)$ Problems

International Journal of Computational Geometry and Applications, 1992, 2 (1), pp.97-111. ⟨10.1142/S021819599200007X⟩
Journal articles

### Applications of random sampling to on-line algorithms in computational geometry

Discrete and Computational Geometry, 1992, 8 (1), pp.51--71. ⟨10.1007/BF02293035⟩
Journal articles

### Computing the Union of 3-Colored Triangles

International Journal of Computational Geometry and Applications, 1991, 1 (2), pp.187-196. ⟨10.1142/S021819599100013X⟩
Journal articles

### Randomisation, sphères et déplacements de robots

Informatique [cs]. Université Nice Sophia Antipolis, 1993
Habilitation à diriger des recherches

### Méthodes d'optimisation du tracé de rayons

Synthèse d'image et réalité virtuelle [cs.GR]. Université Paris Sud - Paris XI, 1988. Français. ⟨NNT : ⟩
Theses

### Stochastic Analysis of Empty-Region Graphs

CCCG 2021 - 33rd Canadian Conference on Computational Geometry, Aug 2021, Halifax / Virtual, Canada
Conference papers

### Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs

EuroCG 2020 - 36th European Workshop on Computational Geometry, Mar 2020, Würzburg, Germany
Conference papers

### Hardness results on Voronoi, Laguerre and Apollonius diagrams

CCCG 2019 - Canadian Conference on Computational Geometry, Aug 2019, Edmonton, Canada
Conference papers

### Randomized incremental construction of Delaunay triangulations of nice point sets

ESA 2019 - 27th Annual European Symposium on Algorithms, Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.22⟩
Conference papers

### A Poisson sample of a smooth surface is a good sample

EuroCG 2019 - 35th European Workshop on Computational Geometry, Mar 2019, Utrecht, Netherlands
Conference papers

### 3D Snap Rounding

Proceedings of the 34th International Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.30:1 - 30:14, ⟨10.4230/LIPIcs.SoCG.2018.30⟩
Conference papers

### Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$

24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece. ⟨10.1007/978-3-319-50106-2_42⟩
Conference papers

### Qualitative Symbolic Perturbation

Proceedings of the 32nd International Symposium on Computational Geometry, Jun 2016, Boston, United States. pp.33:1-33:15, ⟨10.4230/LIPIcs.SoCG.2016.33⟩
Conference papers

### On the smoothed complexity of convex hulls

Proceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩
Conference papers

### Recognizing shrinkable complexes is NP-complete

ESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩
Conference papers

### Efficiently Navigating a Random Delaunay Triangulation

AofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France
Conference papers

### Vertex Deletion for 3D Delaunay Triangulations

Proceedings of the 21st European Symposium on Algorithms, 2013, Sophia Antipolis, France. pp.253-264, ⟨10.1007/978-3-642-40450-4_22⟩
Conference papers

### Homological Reconstruction and Simplification in R3

SoCG 2013 - 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩
Conference papers

### Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical

Proceedings of the 29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.67-76, ⟨10.1145/2462356.2462365⟩
Conference papers

### Complexity Analysis of Random Geometric Structures Made Simpler

29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩
Conference papers

### ESQ: Editable SQuad Representation for Triangle Meshes

25th SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2012, Aug 2012, Ouro Preto, Brazil. pp.110-117, ⟨10.1109/SIBGRAPI.2012.24⟩
Conference papers

### Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-line Drawings

Graph Drawing - 20th International Symposium, GD 2012, Sep 2012, Redmond, WA, United States. pp.376-387, ⟨10.1007/978-3-642-36763-2_34⟩
Conference papers

### Delaunay triangulations, theory vs practice.

EuroCG, 28th European Workshop on Computational Geometry, 2012, Assisi, Italy
Conference papers

### Delaunay triangulation of imprecise points, preprocess and actually get a fast query time

XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain
Conference papers

### Explicit array-based compact data structures for triangulations

22nd International Symposium on Algorithms and Computation, 2011, Yokohama, Japan. pp.312--322
Conference papers

### Simple and Efficient Distribution-Sensitive Point Location in Triangulations

Proceedings of the 13th Workshop on Algorithm Engineering and Experiments, 2011, San Francisco, United States. pp.127-138
Conference papers

### Hyperbolic Delaunay triangulations and Voronoi diagrams made practical

XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain
Conference papers

### Explicit array-based compact data structures for planar and surface meshes

XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain
Conference papers

### A Pedagogic JavaScript Program for Point Location Strategies

27th Annual Symposium on Computational Geometry (Video), 2011, Paris, France. pp.295-296, ⟨10.1145/1998196.1998244⟩
Conference papers

### Oja Medians and Centers of Gravity

22th Canadian Conference on Computational Geometry, Aug 2010, Winnipeg, Canada
Conference papers

### Fast Delaunay Triangulation for Converging Point Relocation Sequences

European Workshop on Computational Geometry, 2009, Bruxelles, Belgium
Conference papers

### Lower and upper bounds on the number of empty cylinders and ellipsoids

European Workshop on Computational Geometry, Mar 2009, Bruxelles, Belgium. pp.139-142
Conference papers

### Incremental construction of the Delaunay graph in medium dimension

Proceedings of the 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, ⟨10.1145/1542362.1542403⟩
Conference papers

### Helly-type theorems for approximate covering

SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128
Conference papers

### Empty-ellipse graphs

19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256
Conference papers

### Predicates for line transversals to lines and line segments in three-dimensional space

SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩
Conference papers

### Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation

Proceedings of the 16th International Meshing Roundtable, Oct 2007, Seattle, United States. pp.83-101, ⟨10.1007/978-3-540-75103-8_5⟩
Conference papers

### Between umbra and penumbra

Proceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩
Conference papers

### Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra

ACM-SIAM Symposium on Discrete Algorithms, Jan 2007, New Orleans, United States. pp.1106--1113
Conference papers

### 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⟩
Conference papers

### 2D Triangulation Representation Using Stable Catalogs

Proc. 18th Canadian Conference on Computational Geometry, Aug 2006, Kingston, Canada, France
Conference papers

### Accurate Interactive Specular Reflections on Curved Objects

Vision Modeling and Visualization (VMV 2005), Nov 2005, Erlangen, Germany. pp.8
Conference papers

### Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint

17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada
Conference papers

### Succinct representation of triangulations with a boundary

9th Workshop on Algorithms and Data Structures, Aug 2005, Waterloo, Canada, pp.134--135
Conference papers

### 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
Conference papers

### Dynamic updates of succinct triangulations

18th Canadian Conference on Computational Geometry, 2005, Windsor, Canada, France
Conference papers

### The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D

Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
Conference papers

### Inner and outer rounding of set operations on lattice polygonal regions

Proceedings of the 20th Annual Symposium on Computational geometry, 2004, Brooklynn, United States. pp.429-437, ⟨10.1145/997817.997881⟩
Conference papers

### On the number of line tangents to four triangles in three-dimensional space

16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p
Conference papers

### Isotropic Surface Remeshing

International Conference on Shape Modeling and applications,, May 2003, Seoul, South Korea
Conference papers

### Efficient Exact Geometric Predicates for Delaunay Triangulations

Proceedings of the 5th Workshop on Algorithm Engineering and Experiments, Jan 2003, Baltimore, Maryland, United States. pp.37-44
Conference papers

### Perturbations and Vertex Removal in a 3D Delaunay Triangulation

Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, Baltimore, MA, United States. pp.313--319
Conference papers

### Transmission progressive de modèles triangulés sur le réseau

CORESA, Jan 2003, Lyon, France
Conference papers

### Compression de maillages, un état de l’art

CORESA, 2003, Lyon, France
Conference papers

### On the Number of Lines Tangent to Four Convex Polyhedra

14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
Conference papers

### Walking in a Triangulation

Proceedings of the 17th Annual Symposium on Computational Geometry, Jun 2001, Boston, United States. pp.106-114, ⟨10.1145/378583.378643⟩
Conference papers

### The shuffling buffer

13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada
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⟩
Conference papers

### Separating Several Point Sets in the Plane

13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada
Conference papers

### Evaluating the cylindricity of a nominally cylindrical point set

Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, Jan 2000, San Francisco, United States
Conference papers

### Geometric compression for interactive transmission

Proceedings of the conference on Visualization '00, 2000, Salt Lake City, United States. pp.319-326, ⟨10.1109/VISUAL.2000.885711⟩
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⟩
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⟩
Conference papers

### On deletion in Delaunay triangulations

Proceedings of the 15th Annual Symposium on Computational Geometry, 1999, Miami, United States. pp.181-189, ⟨10.1145/304893.304969⟩
Conference papers

### Rounding Voronoi Diagram

Discrete Geometry and Computational Imagery, 1999, Noisy le grand, France. pp.375-387
Conference papers

### 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
Conference papers

### Improved incremental randomized Delaunay triangulation

Proceedings of the 14th Annual Symposium on Computational Geometry, 1998, Mineapolis, United States. pp.106-115, ⟨10.1145/276884.276896⟩
Conference papers

### Removing Degeneracies by Perturbing the Problem or the World

Canadian Conference on Computational Geometry, 1998, Montreal, Canada
Conference papers

### Checking the convexity of polytopes and the planarity of subdivisions

Workshop Algorithms and Data Structures, 1997, Halifax, Canada. pp.186-199
Conference papers

### Computing Largest Circles Separating Two Sets of Segments

8th Canadian Conference on Computational Geometry, 1996, Ottawa, Canada
Conference papers

### Symbolic Elimination for parallel manipulators

Communication at 4th International Symposium on Effective Methods in Algebraic Geometry (MEGA)., 1996, Eindhoven, Netherlands
Conference papers

### Computing the Maximum Overlap of Two Convex Polygons Under Translations

International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135
Conference papers

### Optimal Line Bipartitions of Point Sets

International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.45-54
Conference papers

### Computational geometry and discrete computations

Discrete Geometry for Computer Imagery, 1996, Lyon, France
Conference papers

### A Locally Optimal Triangulation of the Hyperbolic Paraboloid

Canadian Conference on Computational Geometry, Aug 1995, Quebec, Canada. pp.49-54
Conference papers

### Circular separability of polygon

Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281
Conference papers

### Evaluation of a new method to compute signs of determinants

Proceedings of the 11th Annual Symposium on Computational Geometry, 1995, Vancouver, Canada. pp.C16-C17, ⟨10.1145/220279.220329⟩
Conference papers

### Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points.

Conference papers

### An introduction to randomization in computational geometry

Workshop on Algorithmic Complexity of Algebraic and Geometric Models, 1994, ~, France
Conference papers

### From spider robots to half disk robots

IEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958
Conference papers

### Motion planning of legged robots

Workshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States
Conference papers

### Convex Tours of Bounded Curvature

Proceedings of the 2nd European Symposium on Algorithms, 1994, Utrecht, Netherlands. pp.254-265, ⟨10.1007/BFb0049413⟩
Conference papers

### Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

Conference papers

### Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers

Workshop Algorithms and Data Structures, 1993, Montreal, Canada. pp.277-288
Conference papers

### Computing the whole set of Connolly Surfaces

Annual Conference of the Molecular Graphics Society, 1993, ~, France
Conference papers

### Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems

Proceedings of 1st European Symposium on Algorithms, 1993, Nad Honef, Germany. pp.133-144, ⟨10.1007/3-540-57273-2_50⟩
Conference papers

### 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
Conference papers

### Stable placements of spider robots

Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, Berlin, Germany. pp.242-250, ⟨10.1145/142675.142725⟩
Conference papers

### An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d

Canadian Conference on Computational Geometry, 1992, St. John's, Canada
Conference papers

### Motion planning for a spider robot

IEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326
Conference papers

### Computing Connolly Surfaces

IFIP Conference on Algorithms and efficient computation, 1992, ?, France
Conference papers

### Guarding Vertices versus Guarding Edges in a Simple Polygon

4th Canadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.99-102
Conference papers

### Computing the Union of 3-Colored Triangles

System Modelling and Optimization, IFIP, 1991, Zurich, Switzerland. pp.85-93
Conference papers

### Fully dynamic Delaunay triangulation in logarithmic expected time per operation

Workshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53
Conference papers

### On-line geometric algorithms with good expected behaviours

3th World Congress on Computation and Applied Mathematics, 1991, ~, France. pp.137-139
Conference papers

### Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of points

Canadian Conference on Computational Geometry, 1991, Burnaby, Canada. pp.110-113
Conference papers

### Simple randomized $O(n \log^{*} n)$ algorithms

Canadian Conference on Computational Geometry, 1991, Burnaby, Canada. pp.141-144
Conference papers

### An on-line construction of higher-order Voronoi diagrams and its randomized analysis

Canadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281
Conference papers

### The Macro-Regions,an Efficient Space Subdivision Structure for Ray Tracing

Eurographics, 1989, Hambourg, Germany. pp.27-38
Conference papers

### Tools to Study the Efficiency of Space Subdivision Structures for Ray Tracing

PIXIM, 1989, Paris, France. pp.467-481
Conference papers

### The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex

AofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (2014), Jun 2014, Paris, France
Conference poster

### A generator of random convex polygons in a disc

AofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France
Conference poster

### A chaotic random convex hull

AofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France
Conference poster

### Tiling the hyperbolic plane

Bending Reality: Where art and science meet, 2013, Dagstuhl, Wadern, Germany
Conference poster

### Vertex Deletion for 3D Delaunay Triangulations

ACM. Symposium on Theory of Computing, 2013, Palo Alto, United States. 2013
Conference poster

### Crossing-free straight-line drawing of graphs on the flat torus

Workshop on Geometric Structures with Symmetry and Periodicity, 2014, Kyoto, Japan
Documents associated with scientific events

### Gedeon

1999
Other publications

### Covering families of triangles

[Research Report] RR-9378, INRIA. 2020, pp.31
Reports

### Randomized incremental construction of Delaunay triangulations of nice point sets

[Research Report] INRIA. 2019
Reports

### Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs

[Research Report] INRIA. 2019, pp.18
Reports

### 3D Snap Rounding

[Research Report] RR-9149, Inria Nancy - Grand Est. 2018, pp.1-22
Reports

### A Poisson sample of a smooth surface is a good sample

[Research Report] RR-9239, INRIA Nancy. 2018, pp.8
Reports

### 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
Reports

### Explicit array-based compact data structures for triangulations: practical solutions with theoretical guarantees

[Research Report] RR-7736, INRIA. 2017, pp.39
Reports

### Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions

[Research Report] RR-9099, INRIA Nancy. 2017
Reports

### Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path

[Research Report] RR-8946, INRIA Nancy. 2016
Reports

### Expected Length of the Voronoi Path in a High Dimensional Poisson-Delaunay Triangulation

[Research Report] RR-8947, Inria. 2016
Reports

### Stretch Factor of Long Paths in a planar Poisson-Delaunay Triangulation

[Research Report] RR-8935, Inria. 2016, pp.34
Reports

### Qualitative Symbolic Perturbation: a new geometry-based perturbation framework

[Research Report] RR-8153, INRIA. 2015, pp.34
Reports

### Smoothed complexity of convex hulls by witnesses and collectors

[Research Report] 8787, INRIA. 2015, pp.41
Reports

### The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$

[Research Report] RR-8792, INRIA. 2015, pp.25
Reports

### A generator of random convex polygons in a disc

[Research Report] RR-8467, INRIA. 2014, pp.9
Reports

### A convex body with chaotic random convex hull

[Research Report] RR-8437, INRIA. 2013
Reports

### Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings

[Research Report] RR-7989, INRIA. 2012
Reports

### The monotonicity of f-vectors of random polytopes

[Research Report] RR-8154, INRIA. 2012, pp.10
Reports

### Complexity analysis of random geometric structures made simpler

[Research Report] RR-8168, INRIA. 2012
Reports

### ESQ: Editable SQuad representation for triangle meshes

[Research Report] RR-8066, INRIA. 2012
Reports

### A cone can help you find your way in a Poisson Delaunay triangulation

[Research Report] RR-8194, INRIA. 2012
Reports

### Hyperbolic Delaunay complexes and Voronoi diagrams made practical

[Research Report] RR-8146, INRIA. 2012
Reports

### Homological reconstruction and simplification in R3

[Research Report] RR-8169, INRIA. 2012
Reports

### Walking Faster in a Triangulation

[Research Report] RR-7322, Inria. 2010, pp.15
Reports

### On the Size of Some Trees Embedded in Rd

[Research Report] RR-7179, INRIA. 2010
Reports

### Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time

[Research Report] RR-7299, INRIA. 2010, pp.10
Reports

### Vertex Removal in Two Dimensional Delaunay Triangulation: Asymptotic Complexity is Pointless

[Research Report] RR-7104, INRIA. 2009, pp.15
Reports

### The Effect of Noise on the Number of Extreme Points

[Research Report] RR-7134, INRIA. 2009, pp.24
Reports

### Self-Adapting Point Location

[Research Report] RR-7132, INRIA. 2009, pp.24
Reports

### Géométrie algorithmique et réseaux

[Research Report] RR-6514, INRIA. 2008
Reports

### A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron

[Research Report] RR-6522, -; INRIA. 2008
Reports

### Delaunay Triangulations for Moving Points

[Research Report] RR-6750, INRIA. 2008
Reports

### State of the Art: Updating Delaunay Triangulations for Moving Points

[Research Report] RR-6665, INRIA. 2008, pp.12
Reports

### Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem

[Research Report] RR-6748, INRIA. 2008
Reports

### On the Complexity of Umbra and Penumbra

[Research Report] RR-6347, INRIA. 2007, pp.28
Reports

### Random sampling of a cylinder yields a not so nasty Delaunay triangulation

[Research Report] RR-6323, INRIA. 2007, pp.10
Reports

### Helly-type theorems for approximate covering

[Research Report] RR-6342, INRIA. 2007, pp.12
Reports

### Farthest Point Seeding for Placement of Streamlines

[Research Report] RR-5524, INRIA. 2006, pp.28
Reports

### Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations

[Research Report] RR-5968, INRIA. 2006, pp.11
Reports

### Optimal succinct representation of planar maps

[Research Report] RR-5803, INRIA. 2006, pp.26
Reports

### Dynamic updates of succinct triangulations

[Research Report] RR-5709, INRIA. 2006, pp.23
Reports

### Compact representation of triangulations

[Research Report] RR-5433, INRIA. 2006, pp.20
Reports

### Complexity of Delaunay triangulation for points on lower-dimensional~polyhedra

[Research Report] RR-5986, INRIA. 2006, pp.12
Reports

### Lines tangent to four triangles in three-dimensional space

[Research Report] RR-5693, INRIA. 2005
Reports

### Drawing $K_n$ in Three Dimensions with One Bend per Edge

[Research Report] RR-5708, INRIA. 2005
Reports

### On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra

[Research Report] RR-5671, INRIA. 2005
Reports

### Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint

[Research Report] RR-5742, INRIA. 2005, pp.11
Reports

### Watermarking 3D triangle meshes for authentication and integrity

[Research Report] RR-5223, INRIA. 2004
Reports

### Canonical Triangulation of a Graph, with a Coding Application

RR-5231, INRIA. 2004, pp.24
Reports

### Inner and Outer Rounding of Set Operations on Lattice Polygonal Regions

RR-5070, INRIA. 2003
Reports

### Anisotropic Polygonal Remeshing

[Research Report] RR-4808, INRIA. 2003
Reports

### Perturbations and Vertex Removal in a 3D Delaunay Triangulation

RR-4624, INRIA. 2002
Reports

### Finite Precision Elementary Geometric Constructions

RR-4559, INRIA. 2002
Reports

### Faster Triangle-Triangle Intersection Tests

RR-4488, INRIA. 2002
Reports

### Efficient Exact Geometric Predicates for Delaunay Triangulations

RR-4351, INRIA. 2002
Reports

### The expected number of 3D visibility events is linear

[Research Report] RR-4671, INRIA. 2002
Reports

### Isotropic Surface Remeshing

RR-4594, INRIA. 2002
Reports

### Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position

RR-4352, INRIA. 2002
Reports

### On circular Cylinders by Four or Five Points in Space

RR-4195, INRIA. 2001
Reports

### Culling a Set of Points for Roundness or Cylindricity Evaluations

RR-4159, INRIA. 2001
Reports

### Compression interactive de maillages triangulaires arbitraires

RR-4158, INRIA. 2001
Reports

### Splitting a Delaunay Triangulation in Linear Time

RR-4160, INRIA. 2001
Reports

### Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction

RR-4119, INRIA. 2001
Reports

### On the Number of Cylindrical Shells

RR-4234, INRIA. 2001
Reports

### Walking in a triangulation

RR-4120, INRIA. 2001
Reports

### Le tampon mélangeur

[Rapport de recherche] RR-3988, INRIA. 2000, pp.38
Reports

### Geometric Compression for Interactive Transmission

[Research Report] RR-3910, INRIA. 2000, pp.23
Reports

### The union of Unit Balls has Quadratic Complexity, even if They all Contain the Origin

RR-3758, INRIA. 1999
Reports

### Evaluating the Cylindricity of a Nominally Cylindrical Point Set (Draft)

RR-3747, INRIA. 1999
Reports

### Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs

RR-3826, INRIA. 1999
Reports

### Compression géométrique pour une transmission progressive

RR-3766, INRIA. 1999
Reports

### Computational Geometry and Discrete Computations

RR-3533, INRIA. 1998
Reports

### Finding an Ordinary Conic and an Ordinary Hyperplane

RR-3517, INRIA. 1998
Reports

### Further Results on Arithmetic Filters for Geometric Predicates

RR-3528, INRIA. 1998
Reports

### Rounding Voronoi Diagram

RR-3481, INRIA. 1998
Reports

### Checking the Convexity of Polytopes and the Planarity of Subdivisions

RR-3527, INRIA. 1998
Reports

### On Deletion in Delaunay Triangulation

RR-3451, INRIA. 1998
Reports

### Motion Planning of Legged Robots

RR-3214, INRIA. 1997
Reports

### Improved Incremental Randomized Delaunay Triangulation.

RR-3298, INRIA. 1997
Reports

### Removing Degeneracies by Perturbing the Problem or the World

RR-3316, INRIA. 1997
Reports

### A Probabilistic Analysis of the Power of Arithmetic Filters

RR-2971, INRIA. 1996
Reports

### Optimal Line Bipartitions of Point Sets

RR-2871, INRIA. 1996
Reports

### Computing the Maximum Overlap of Two Convex Polygons Under Translations

RR-2832, INRIA. 1996
Reports

### Symbolic Elimination for Parallel Manipulators

RR-2809, INRIA. 1996
Reports

### Computing Largest Circles Separating Two Sets of Segments

RR-2705, INRIA. 1995
Reports

### Computing a Single Cell in the Union of two Simple Polygons

RR-2626, INRIA. 1995
Reports

### Convex Tours of Bounded Curvature

[Research Report] RR-2375, INRIA. 1994
Reports

### Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points

[Research Report] RR-2329, INRIA. 1994
Reports

### Circular Separability of Polygons

RR-2406, INRIA. 1994
Reports

### Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

[Research Report] RR-2280, INRIA. 1994
Reports

### Dog bites postman: point location in the moving Voronoi diagram and related problems

[Research Report] RR-2263, INRIA. 1994
Reports