Co-auteurs

Nombre de documents

276

Publications of Olivier Devillers


my homepage,

 

PhD students


HDR1 document

  • Olivier Devillers. Randomisation, sphères et déplacements de robots. Informatique [cs]. Université Nice Sophia Antipolis, 1993. <tel-00338329>

Thèse1 document

  • Olivier Devillers. 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. <tel-00772857>

Article dans une revue74 documents

  • Nicolas Broutin, Olivier Devillers, Ross Hemsley. Efficiently navigating a random Delaunay triangulation. Random Structures and Algorithms, Wiley, 2016, 49 (1), pp.95--136. <10.1002/rsa.20630>. <hal-00940743v3>
  • Olivier Devillers, Ross 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. <http://jocg.org/v7n1p16>. <10.20382/jocg.v7i1a16>. <hal-01348831>
  • Olivier Devillers, Marc Glisse, Xavier Goaoc, Ré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. <http://jocg.org/v7n2p6>. <10.20382/jocg.v7i2a6>. <hal-01285120>
  • Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard. Recognizing Shrinkable Complexes Is NP-Complete. Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.430--443. <http://jocg.org/index.php/jocg/article/view/275>. <10.20382/jocg.v7i1a18>. <hal-01384396>
  • Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier. Homological Reconstruction and Simplification in R3. Computational Geometry, Elsevier, 2014, http://www.sciencedirect.com/science/article/pii/S0925772114000923. <10.1016/j.comgeo.2014.08.010>. <hal-01132440>
  • Mikhail Bogdanov, Olivier Devillers, Monique Teillaud. Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical. Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2014, 5 (1), pp.56-85. <http://jocg.org/v5n1p4>. <10.20382/jocg.v5i1a4>. <hal-00961390>
  • Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin. Oja centers and centers of gravity. Computational Geometry, Elsevier, 2013, 46 (2), pp.140-147. <10.1016/j.comgeo.2012.04.004>. <hal-00787177>
  • Pedro Machado Manhães de Castro, Olivier Devillers. Practical Distribution-Sensitive Point Location in Triangulations. Computer Aided Geometric Design, Elsevier, 2013, 30, pp.431-450. <10.1016/j.cagd.2013.02.004>. <hal-00803093>
  • Olivier Devillers, Marc Glisse, Xavier Goaoc, Guillaume Moroz, Matthias Reitzner. The monotonicity of $f$-vectors of random polytopes. Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2013, 18 (23), pp.1-8. <10.1214/ECP.v18-2469>. <hal-00805690>
  • Nina Amenta, Dominique Attali, Olivier Devillers. A tight bound for the Delaunay triangulation of points on a polyhedron. Discrete and Computational Geometry, Springer Verlag, 2012, 48 (1), pp.19-38. <10.1007/s00454-012-9415-7>. <hal-00784900>
  • Pedro Machado Manhães de Castro, Olivier Devillers. On the Size of Some Trees Embedded in ${\mathbb R}^d$. Operations Research Letters, Elsevier, 2011, 39, pp.44-48. <10.1016/j.orl.2010.10.005>. <hal-00991081>
  • Luca Castelli Aleardi, Olivier Devillers, Abdelkrim Mebarki. Catalog Based Representation of 2D triangulations. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2011, 21 (4), pp.393-402. <10.1142/S021819591100372X>. <inria-00560400>
  • Olivier Devillers, Monique Teillaud. Perturbations for Delaunay and weighted Delaunay 3D Triangulations. Computational Geometry, Elsevier, 2011, 44, pp.160--168. <10.1016/j.comgeo.2010.09.010>. <inria-00560388>
  • Olivier Devillers. Vertex Removal in Two Dimensional Delaunay Triangulation: Speed-up by Low Degrees Optimization. Computational Geometry, Elsevier, 2011, 44, pp.169-177. <10.1016/j.comgeo.2010.10.001>. <inria-00560379>
  • 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. <http://jocg.org/v2n1p3>. <10.20382/jocg.v2i1a3>. <inria-00595823>
  • Jane Tournois, Pierre Alliez, Olivier Devillers. 2D Centroidal Voronoi Tessellations with Constraints. Numerical Mathematics: Theory, Methods and Applications, Global Science Press, 2010, 3 (2), pp.212--222. <http://www.global-sci.org/nmtma/volumes/v3n2/pdf/32-212.pdf>. <10.4208/nmtma.2010.32s.6>. <inria-00523812v2>
  • Pedro Machado Manhães de Castro, Jane Tournois, Pierre Alliez, Olivier Devillers. Filtering Relocations on a Delaunay Triangulation. Computer Graphics Forum, Wiley, 2009, <10.1111/j.1467-8659.2009.01523.x>. <inria-00413344>
  • Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc. Helly-type theorems for approximate covering. Discrete and Computational Geometry, Springer Verlag, 2009, 42 (3), pp.379--398. <10.1007/s00454-009-9167-1>. <inria-00404171>
  • Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Succinct representations of planar maps. Theoretical Computer Science, Elsevier, 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>. <inria-00337821>
  • Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile. Lines tangent to four triangles in three-dimensional space. Discrete and Computational Geometry, Springer Verlag, 2007, 37 (3), pp.369-380. <10.1007/s00454-006-1278-3>. <inria-00000598>
  • Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, et al.. Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.297-304. <10.1142/S0218195907002343>. <inria-00192927>
  • Hervé Bronnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, et al.. Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. <10.1137/S0097539705447116>. <inria-00103916>
  • Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Steve Wismath. Drawing Kn in Three Dimensions with One Bend per Edge. Journal of Graph Algorithms and Applications (JGAA), Brown University, 2006, 10 (2), pp.287-295. <inria-00103923>
  • Olivier Devillers. Un joli algorithme géométrique et ses vilains problèmes numériques. Interstices, INRIA, 2006, pp.~. <https://interstices.info/jcms/c_16014/un-joli-algorithme-geometrique-et-ses-vilains-problemes-numeriques>. <inria-00097857>
  • Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg. Centroidal Voronoi diagrams for isotropic surface remeshing. Graphical Models, Elsevier, 2005, 67 (3), pp.204-231. <10.1016/j.gmod.2004.06.007>. <hal-00787166>
  • Olivier Devillers, Philippe Guigue. Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions. Computational Geometry, Elsevier, 2005, 33, pp.3--17. <inria-00001250>
  • Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro Ramos, et al.. Minimal set of constraints for 2D constrained Delaunay reconstruction. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (5), pp.391-398. <10.1142/S0218195903001244>. <hal-00787186>
  • Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Lévy, Mathieu Desbrun. Anisotropic Polygonal Remeshing. ACM Transactions on Graphics, Association for Computing Machinery, 2003, 22 (3), pp.485-493. <10.1145/1201775.882296>. <inria-00099624>
  • Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, et al.. The expected number of 3D visibility events is linear. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2003, 32 (6), pp.1586-1620. <10.1137/S0097539702419662>. <inria-00099810>
  • Philippe Guigue, Olivier Devillers. Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates. Journal of graphics tools, A.K. Peters, Ltd., 2003, 8 (1), pp.39-52. <10.1080/10867651.2003.10487580>. <hal-00795042>
  • 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-00090638>
  • Olivier Devillers, Franco Preparata. Culling a Set of Points for Roundness or Cylindricity Evaluations. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13, pp.231-240. <inria-00412608>
  • Olivier Devillers, Ferran Hurtado, Gyula Károlyi, Carlos Seara. Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position. Computational Geometry, Elsevier, 2003, 26, pp.193-208. <inria-00412646>
  • Olivier Devillers, Sylvain Pion, Monique Teillaud. Walking in a Triangulation. International Journal of Foundations of Computer Science, World Scientific Publishing, 2002, 13, pp.181--199. <inria-00102194>
  • Olivier Devillers. On Deletion in Delaunay Triangulations. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2002, 12, pp.193-205. <inria-00167201>
  • Olivier Devillers, Pierre-Marie Gandoin. Rounding Voronoi Diagram. Theoretical Computer Science, Elsevier, 2002, 283 (1), pp.203--221. <10.1016/S0304-3975(01)00076-7>. <hal-00795053>
  • Olivier Devillers, Pedro Ramos. Computing Roundness is Easy if the Set is Almost Round. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2002, 12 (3), pp.229-248. <10.1142/S0218195902000840>. <hal-00795064>
  • Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, et al.. Splitting a Delaunay Triangulation in Linear Time. Algorithmica, Springer Verlag, 2002, 34 (1), pp.39--46. <10.1007/s00453-002-0939-8>. <inria-00090664>
  • Olivier Devillers, Bernard Mourrain, Franco Preparata, Philippe Trebuchet. Circular Cylinders by Four or Five Points in Space. Discrete and Computational Geometry, Springer Verlag, 2002, 29 (1), pp.83--104. <10.1007/s00454-002-2811-7>. <inria-00090648>
  • Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud. 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-00166709>
  • Olivier Devillers. The Delaunay Hierarchy. International Journal of Foundations of Computer Science, World Scientific Publishing, 2002, 13, pp.163-180. <inria-00166711>
  • Pierre-Marie Gandoin, Olivier Devillers. Progressive Lossless Compression of Arbitrary Simplicial Complexes. ACM Transactions on Graphics, Association for Computing Machinery, 2002, 21 (Siggraph'2002 Conference proceedings), pp.372-379. <inria-00167216>
  • Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, Mariette Yvinec. Triangulations in CGAL. Computational Geometry, Elsevier, 2002, 22, pp.5-19. <inria-00167199>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec. Circular Separability of Polygons. Algorithmica, Springer Verlag, 2001, 30 (1), pp.67--82. <inria-00090667>
  • Olivier Devillers, Philippe Guigue. The shuffling buffer. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2001, 11, pp.555-572. <http://www.worldscinet.com/ijcga/11/1105/S021819590100064X.html>. <10.1142/S021819590100064X>. <inria-00412567>
  • Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard. Motion planning of legged robots. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2000, 30 (1), pp.218-246. <10.1137/S0097539797326289>. <inria-00099289>
  • Pierre Alliez, Olivier Devillers, Jack Snoeyink. Removing degeneracies by perturbing the problem or perturbing the world. Reliable Computing, Springer Verlag, 2000. <inria-00338566>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. Computing Largest Circles Separating Two Sets of Segments. International Journal of Computational Geometry and Applications, World Scientific Publishing, 2000, 10, pp.41--54. <inria-00338701>
  • Olivier Devillers, Matthew J. Katz. Optimal Line Bipartitions of Point Sets. International Journal of Computational Geometry and Applications, World Scientific Publishing, 1999, 9 (1), pp.39-51. <10.1142/S0218195999000042>. <hal-00795067>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec. Convex Tours of Bounded Curvature.. Computational Geometry, Elsevier, 1999, 13, pp.149-160. <inria-00413181>
  • Olivier Devillers, Franco Preparata. Further Results on Arithmetic Filters for Geometric Predicates. Computational Geometry, Elsevier, 1999, 13, pp.141-148. <inria-00168163>
  • Olivier Devillers, Asish Mukhopadhyay. Finding an ordinary conic and an ordinary hyperplane. Nordic Journal of Computing, Publishing Association Nordic Journal of Computing, 1999, 6, pp.462-468. <inria-00168174>
  • Olivier Devillers, Mordecai Golin. Dog bites postman: point location in the moving Voronoi diagram and related problems. International Journal of Computational Geometry and Applications, World Scientific Publishing, 1998, 8 (3), pp.321-342. <10.1142/S0218195998000163>. <hal-00795074>
  • Olivier Devillers, Franco 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>. <inria-00090653>
  • Mark De Berg, Olivier Devillers, Marc Van Kreveld, Otfried Schwarzkopf, Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations.. Theory of Computing Systems, Springer Verlag, 1998, 31, pp.613-628. <inria-00413175>
  • Olivier Devillers, Giuseppe Liotta, Franco Preparata, Roberto Tamassia. Checking the convexity of polytopes and the planarity of subdivisions.. Computational Geometry, Elsevier, 1998, 11, pp.187-208. <inria-00413179>
  • Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata, Mariette Yvinec. Evaluating signs of determinants using single-precision arithmeti. Algorithmica, Springer Verlag, 1997, 17 (2), pp.111-132. <inria-00090613>
  • Mark De Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf. Computing a single cell in the union of two simple polygons. Information Processing Letters, Elsevier, 1997, 63, pp.215-219. <inria-00413170>
  • Olivier Devillers. An Introduction to Randomization in Computational Geometry.. Theoretical Computer Science, Elsevier, 1996, 157, pp.35-52. <inria-00167202>
  • Jean-Daniel Boissonnat, André Cerezo, Olivier Devillers, Monique 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>. <hal-00795075>
  • Olivier Devillers, Andreas Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. International Journal of Computational Geometry and Applications, World Scientific Publishing, 1996, 6 (4), pp.487-506. <10.1142/S0218195996000307>. <hal-00795079>
  • Jean-Daniel Boissonnat, André Cerezo, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec. An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d. Computational Geometry, Elsevier, 1996, 6, pp.123-130. <inria-00413159>
  • Olivier Devillers, Mordecai Golin, Klara Kedem, Stefan Schirra. Queries on Voronoi Diagrams of Moving Points. Computational Geometry, Elsevier, 1996, 6, pp.315-327. <inria-00413168>
  • Jean-Daniel Boissonnat, Olivier Devillers, Leonbattista Donati, Franco Preparata. Motion planning of legged robots: the spider robot problem. International Journal of Computational Geometry and Applications, World Scientific Publishing, 1995, 5 (1), pp.3-20. <10.1142/S0218195995000027>. <hal-00795083>
  • Olivier Devillers, Mordecai Golin. Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. Information Processing Letters, Elsevier, 1995, 56 (3), pp.157-164. <inria-00413163>
  • Jean-Daniel Boissonnat, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec. Computing Connolly surfaces. Journal of molecular graphics, Elsevier, 1994, 12 (1), pp.61-62. <10.1016/0263-7855(94)80033-2>. <hal-00795091>
  • Olivier Devillers. Simultaneous Containment of Several Polygons: Analysis of the Contact Configurations. International Journal of Computational Geometry and Applications, World Scientific Publishing, 1993, 3 (4), pp.429-442. <inria-00167170>
  • Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud. A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis. Algorithmica, Springer Verlag, 1993, 9 (4), pp.329-356. <inria-00090668>
  • Olivier Devillers. Randomization Yields Simple $O(n \log^{\star} n)$ Algorithms for Difficult $\Omega(n)$ Problems. International Journal of Computational Geometry and Applications, World Scientific Publishing, 1992, 2 (1), pp.97-111. <inria-00167206>
  • Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec. 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>. <inria-00090675>
  • Olivier Devillers, Stefan Meiser, Monique Teillaud. 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-00090678>
  • Olivier Devillers, Monique Teillaud, Mariette Yvinec. Dynamic location in an arrangement of line segments in the plane. Algorithms Review, ALCOM EC project, 1992, 2 (3), pp.89-103. <inria-00413506>
  • Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata. Computing the Union of 3-Colored Triangles. International Journal of Computational Geometry and Applications, World Scientific Publishing, 1991, 1 (2), pp.187-196. <inria-00167176>

Communication dans un congrès89 documents

  • David Bremner, Olivier Devillers, Marc Glisse, Sylvain Lazard, Giuseppe Liotta, et al.. Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$. 24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece. Springer, Lecture Notes in Computer Science, 9801, Proceedings of 24th International Symposium on Graph Drawing & Network Visualization. <http://algo.math.ntua.gr/~gd2016/>. <hal-01366148>
  • Olivier Devillers, Menelaos Karavelas, Monique Teillaud. Qualitative Symbolic Perturbation. SoCG 2016 - International Symposium on Computational Geometry, Jun 2016, Boston, United States. pp.33:1-33:15, 2016, <http://socg2016.cs.tufts.edu>. <10.4230/LIPIcs.SoCG.2016.33>. <hal-01276444>
  • Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse. On the smoothed complexity of convex hulls. 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. Lipics, 2015, <http://www.win.tue.nl/SoCG2015/>. <10.4230/LIPIcs.SOCG.2015.224>. <hal-01144473v2>
  • Dominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard. Recognizing shrinkable complexes is NP-complete. A. Schulz and D. Wagner. 22nd European Symposium on Algorithms, 2014, Wroclaw, Poland. Springer, 8737, pp.74-86, 2014. <hal-01015747>
  • Nicolas Broutin, Olivier Devillers, Ross Hemsley. 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. 2014, <https://hal.inria.fr/hal-01077251>. <hal-01018174>
  • Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier. Homological Reconstruction and Simplification in R3. 29th Symposium on Computational Geometry (SoCG), Jun 2013, Rio de Janeiro, Brazil. ACM, pp.117-125, 2013, <10.1145/2462356.2462373>. <hal-00833791>
  • Mikhail Bogdanov, Olivier Devillers, Monique Teillaud. Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical. 29th Annual Symposium on Computational Geometry, 2013, Rio, Brazil. ACM, pp.67-76, 2013, <10.1145/2462356.2462365>. <hal-00833760>
  • Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Shewchuk. Vertex Deletion for 3D Delaunay Triangulations. 21st European Symposium on Algorithms, 2013, Sophia Antipolis, France. Springer, 8125, pp.253-264, 2013, LNCS. <hal-00832992>
  • Olivier Devillers, Marc Glisse, Xavier Goaoc. Complexity Analysis of Random Geometric Structures Made Simpler. 29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, 2013, <10.1145/2462356.2462362>. <hal-00833774>
  • Luca Castelli Aleardi, Olivier Devillers, Jarek Rossignac. ESQ: Editable SQuad Representation for Triangle Meshes. 25th SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2012, Aug 2012, Ouro Preto, Brazil. IEEE Computer Society, pp.110-117, 2012, Proc. of 25th SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2012. <http://www.computer.org/csdl/proceedings/sibgrapi/2012/4829/00/4829a110-abs.html>. <10.1109/SIBGRAPI.2012.24>. <hal-00793592>
  • Luca Castelli Aleardi, Olivier Devillers, Eric Fusy. 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. Springer, 7704, pp.376-387, 2012, Lecture Notes in Computer Science; Graph Drawing. <10.1007/978-3-642-36763-2_34>. <hal-00793636>
  • Olivier Devillers. Delaunay triangulations, theory vs practice.. EuroCG, 28th European Workshop on Computational Geometry, 2012, Assisi, Italy. 2012. <hal-00850561>
  • Luca Castelli Aleardi, Olivier Devillers. Explicit array-based compact data structures for triangulations. Takao Asano and Shin-ichi Nakano and Yoshio Okamoto and Osamu Watanabe. 22nd International Symposium on Algorithms and Computation, 2011, Yokohama, Japan. Springer-Verlag, 7074, pp.312--322, 2011, LNCS. <hal-00678615>
  • Mikhail Bogdanov, Olivier Devillers, Monique Teillaud. Hyperbolic Delaunay triangulations and Voronoi diagrams made practical. XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain. 2011. <hal-00850586>
  • Pedro Machado Manhães de Castro, Olivier Devillers. A Pedagogic JavaScript Program for Point Location Strategies. 27th Annual Symposium on Computational Geometry (Video), 2011, Paris, France. ACM, pp.295-296, 2011, <http://www.computational-geometry.org/SoCG-videos/socg11video/>. <10.1145/1998196.1998244>. <hal-00850551>
  • Luca Castelli Aleardi, Olivier Devillers. Explicit array-based compact data structures for planar and surface meshes. XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain. 2011. <hal-00850588>
  • Olivier Devillers. Delaunay triangulation of imprecise points, preprocess and actually get a fast query time. XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain. 2011. <hal-00850583>
  • Pedro Machado Manhães de Castro, Olivier Devillers. Simple and Efficient Distribution-Sensitive Point Location in Triangulations. Thirteenth Workshop on Algorithm Engineering and Experiments, 2011, San Francisco, United States. SIAM, pp.127-138, 2011, <http://www.siam.org/proceedings/alenex/2011/alx11_13_decastrop.pdf>. <hal-00850559>
  • Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin. Oja Medians and Centers of Gravity. 22th Canadian Conference on Computational Geometry, Aug 2010, Winnipeg, Canada. 2010. <inria-00523684>
  • Pedro Machado Manhães de Castro, Olivier Devillers. Fast Delaunay Triangulation for Converging Point Relocation Sequences. European Workshop on Computational Geometry, 2009, Bruxelles, Belgium. 2009. <inria-00413351>
  • Jean-Daniel Boissonnat, Olivier Devillers, Samuel Hornus. Incremental construction of the Delaunay graph in medium dimension. Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, 2009. <inria-00412437>
  • Oswin Aichholzer, Franz Aurenhammer, Olivier Devillers, Thomas Hackl, Monique 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, 2009. <inria-00412352>
  • Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc. Helly-type theorems for approximate covering. Proceedings of the twenty-fourth annual symposium on Computational geometry - SCG '08, Jun 2008, Washington, United States. ACM, pp.120--128, 2008. <inria-00331435>
  • Olivier Devillers, Marc Glisse, Sylvain Lazard. Predicates for line transversals to lines and line segments in three-dimensional space. Monique Teillaud. 24th Annual Symposium on Computational Geometry, 2008, College Park, Maryland, United States. ACM, pp.174-181, 2008. <inria-00336256>
  • Olivier Devillers, Jeff Erickson, Xavier Goaoc. Empty-ellipse graphs. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256, 2008. <inria-00176204>
  • Jane Tournois, Pierre Alliez, Olivier Devillers. Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation. Michael L. Brewer and David Marcum. Proceedings of the 16th International Meshing Roundtable, Oct 2007, Seattle, United States. springer, pp.83-101, 2008, <10.1007/978-3-540-75103-8_5>. <hal-01179018>
  • Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, et al.. Between umbra and penumbra. 23rd Annual Symposium on Computational Geometry - SOCG 2007, Jun 2007, Gyeongju, South Korea. ACM, Session 8A, pp.265-274, 2007, Proceedings of the twenty-third annual symposium on Computational geometry. <10.1145/1247069.1247117>. <inria-00187253>
  • Nina Amenta, Dominique Attali, Olivier Devillers. Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra. 18th ACM-SIAM Sympos. Discrete Algorithms, Jan 2007, New Orleans, United States. pp.1106--1113, 2007. <inria-00182835v2>
  • Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Optimal Succinct Representations of Planar Maps. Proc. 22th Annu. Symposium on Computational Geometry, Jun 2006, Sedona, Arizona, United States. ACM, 2006. <inria-00098669>
  • Olivier Devillers, Abdelkrim Mebarki, Luca Castelli Aleardi. 2D Triangulation Representation Using Stable Catalogs. Proc. 18th Canadian Conference on Computational Geometry, Aug 2006, Kingston, Canada, 2006. <inria-00090631>
  • Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen 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, 2005. <inria-00000374>
  • Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Steve Wismath, et al.. Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. 17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada. 2005. <inria-00000569>
  • Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Dynamic updates of succinct triangulations. 18th Canadian Conference on Computational Geometry, 2005, Windsor, Canada, France. 2005, <http://www.cccg.ca/>. <inria-00001187>
  • Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Succinct representation of triangulations with a boundary. 9th Workshop on Algorithms and Data Structures, Aug 2005, Waterloo, Canada, Springer, 3608, pp.134--135, 2005, Lecture Notes in Computer Science. <inria-00090707>
  • Pau Estalella, Ignacio Martin, George Drettakis, Dani Tost, Olivier Devillers, et al.. Accurate Interactive Specular Reflections on Curved Objects. Günther Greiner. Vision Modeling and Visualization (VMV 2005), Nov 2005, Erlangen, Germany. Berlin : Akademische Verl.-Ges. Aka, 2005., pp.8, 2005. <inria-00606757>
  • Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, et al.. The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D. Symposium on Computational Geometry - SoCG'2004, Jun 2004, Brooklyn, NY, United States. ACM, pp.46 - 55, 2004, <10.1145/997817.997827>. <inria-00103995>
  • Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile. 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, 2004. <inria-00099873>
  • Olivier Devillers, Philippe Guigue. Inner and outer rounding of set operations on lattice polygonal regions. Proceedings of the annual symposium on Computational geometry, 2004, Brooklynn, United States. ACM, pp.429-437, <10.1145/997817.997881>. <hal-01179036>
  • Pierre Alliez, Olivier Devillers, Martin Isenburg, Sebastien Valette. Compression de maillages, un état de l’art. CORESA, 2003, Lyon, France. <hal-01117287>
  • Mario Trentini, Olivier Devillers, Pierre-Marie Gandoin. Transmission progressive de modèles triangulés sur le réseau. CORESA, Jan 2003, Lyon, France. <http://liris.cnrs.fr/m2disco/coresa/coresa-2003/index.html>. <hal-01117289>
  • Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg. Isotropic Surface Remeshing. International Conference on Shape Modeling and applications,, May 2003, Seoul, South Korea. 2003. <inria-00413144>
  • Olivier Devillers, Sylvain Pion. Efficient Exact Geometric Predicates for Delaunay Triangulations. 5th Workshop on Algorithm Engineering and Experiments (ALENEX), Jan 2003, Baltimore, Maryland, United States. pp.37-44, 2003. <inria-00344517>
  • Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. 14th ACM-Siam Symposium on Discrete Algorithms (SODA), 2003, Baltimore, MA, United States. pp.313--319, 2003. <inria-00166710v2>
  • Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, et al.. On the Number of Lines Tangent to Four Convex Polyhedra. 14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada, 2002. <inria-00099449>
  • Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, et al.. Splitting a Delaunay Triangulation in Linear Time. European Symposiumon Algorithms, 2001, Aarhus, Denmark. springer, 2161, pp.312-320, LNCS. <http://www.brics.dk/esa2001/>. <10.1007/3-540-44676-1_26>. <hal-01179401>
  • Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara. Separating Several Point Sets in the Plane. 13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada. <http://www.cccg.ca/proceedings/2001/>. <hal-01179059>
  • Olivier Devillers, Philippe Guigue. The shuffling buffer. 13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada. <hal-01179052>
  • Olivier Devillers, Sylvain Pion, Monique Teillaud. Walking in a Triangulation. 17th Annual ACM Symposium on Computational Geometry (SCG), Jun 2001, Boston, United States. pp.106-114, 2001. <inria-00344519>
  • Olivier Devillers, Pierre-Marie Gandoin. Geometric compression for interactive transmission. Proceedings of the conference on Visualization '00, 2000, Salt Lake City, United States. IEEE, pp.319-326, 2000, <http://www.hpc.msstate.edu/conferences/vis2000/>. <10.1109/VISUAL.2000.885711>. <hal-01179425>
  • Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs. Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.139-147, <http://www.cse.ust.hk/tcsc/scg00.html>. <10.1145/336154.336194>. <hal-01179417>
  • Olivier Devillers, Jean-Daniel Boissonnat, Mariette Yvinec, Monique Teillaud. Triangulations in CGAL. Annual Symposium on Computational Geometry, 2000, Hong Kong, China. ACM, pp.11-18, <http://www.cse.ust.hk/tcsc/scg00.html>. <10.1145/336154.336165>. <hal-01179408>
  • Olivier Devillers, Franco Preparata. Evaluating the cylindricity of a nominally cylindrical point set. ACM-SIAM Sympos. Discrete Algorithms, Jan 2000, San Francisco, United States. 2000. <inria-00412600>
  • Olivier Devillers. On deletion in Delaunay triangulations. Annual Symposium on Computational Geometry, 1999, Miami, United States. ACM, pp.181-189, <http://www.cs.miami.edu/~vjm/SCG99/>. <10.1145/304893.304969>. <hal-01179435>
  • Olivier Devillers, Pierre-Marie Gandoin. Rounding Voronoi Diagram. Discrete Geometry and Computational Imagery, 1999, Noisy le grand, France. springer, 1568, pp.375-387, LNCS. <http://www.dgci-conference.org/>. <hal-01179442>
  • Jean-Daniel Boissonnat, Frédéric Cazals, Tran Kai Frank Da, Olivier Devillers, Sylvain 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. 1999. <inria-00348713>
  • Pierre Alliez, Olivier Devillers, Jack Snoeyink. Removing Degeneracies by Perturbing the Problem or the World. Canadian Conference on Computational Geometry, 1998, Montreal, Canada. <http://www.cccg.ca/proceedings/1998/>. <hal-01179696>
  • Olivier Devillers. Improved incremental randomized Delaunay triangulation. Annual Symposium on Computational Geometry, 1998, Mineapolis, United States. ACM, pp.106-115, <http://www-users.cs.umn.edu/~janardan/SoCG98/>. <10.1145/276884.276896>. <hal-01179446>
  • Olivier Devillers, Giuseppe Liotta, Franco Preparata, Roberto Tamassia. Checking the convexity of polytopes and the planarity of subdivisions. Workshop Algorithms and Data Structures, 1997, Halifax, Canada. springer, 1272, pp.186-199, LNCS. <http://link.springer.com/book/10.1007/3-540-63307-3>. <hal-01179691>
  • Luc Tancredi, Monique Teillaud, Olivier Devillers. Symbolic Elimination for parallel manipulators. Communication at 4th International Symposium on Effective Methods in Algebraic Geometry (MEGA)., 1996, Eindhoven, Netherlands. <hal-01180168>
  • Olivier Devillers, Matthew J. Katz. Optimal Line Bipartitions of Point Sets. International Symposium on Algorithms and Computation, 1996, Osaka, Japan. springer, 1178, pp.45-54, LNCS. <http://www.media.osaka-cu.ac.jp/STAFF/isaac96/>. <hal-01179453>
  • Mark De Berg, Olivier Devillers, Marc Van Kreveld, Otfried Schwarzkopf, Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. International Symposium on Algorithms and Computation, 1996, Osaka, Japan. springer, 1178, pp.126-135, LNCS. <http://www.media.osaka-cu.ac.jp/STAFF/isaac96/>. <hal-01179450>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. Computing Largest Circles Separating Two Sets of Segments. 8th Canadian Conference on Computational Geometry, 1996, Ottawa, Canada. <http://www.cccg.ca/proceedings/1996/>. <hal-01179145>
  • Olivier Devillers. Computational geometry and discrete computations. Discrete Geometry for Computer Imagery, 1996, Lyon, France. Springer-Verlag, 1176, 1996, Lecture Notes in Computer Science. <inria-00338179>
  • Pascal Desnogues, Olivier Devillers. A Locally Optimal Triangulation of the Hyperbolic Paraboloid. Canadian Conference on Computational Geometry, Aug 1995, Quebec, Canada. pp.49-54, 1995. <inria-00413229>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec. Circular separability of polygon. ACM-SIAM symposium on Discrete algorithms, 1995, ~, United States. SIAM, pp.273-281. <hal-01179468>
  • Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata, Mariette Yvinec. Evaluation of a new method to compute signs of determinants. Annual Symposium on Computational Geometry, 1995, Vancouver, Canada. ACM, pp.C16-C17, <http://www.cs.ubc.ca/nest/imager/contributions/snoeyink/acm-scg.html>. <10.1145/220279.220329>. <hal-01179456>
  • Olivier Devillers, Mordecai Golin. Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas. Canadian Conference on Computational Geometry, 1994, Saskatoon, Canada. pp.153-158, <http://www.cccg.ca/>. <hal-01179705>
  • Olivier Devillers, Klara Kedem, Mordecai Golin, Stefan Schirra. Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points.. Canadian Conference on Computational Geometry, 1994, Saskatoon, Canada. pp.122-127, <http://www.cccg.ca/>. <hal-01179708>
  • Olivier Devillers. An introduction to randomization in computational geometry. Workshop on Algorithmic Complexity of Algebraic and Geometric Models, 1994, ~, France. <hal-01179699>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec. Convex Tours of Bounded Curvature. European Symposiumon Algorithms, 1994, Utrecht, Netherlands. springer, 855, pp.254-265, LNCS. <http://esa-symposium.org/>. <hal-01179475>
  • Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard. Motion planning of legged robots. Workshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States. <http://www.wafr.org/>. <hal-01179461>
  • Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard. From spider robots to half disk robots. IEEE International Conference on Robotics and Automation, 1994, San Diego, United States. IEEE, pp.953-958, 1994. <inria-00442776>
  • Olivier Devillers, Mordecai Golin. Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. European Symposiumon Algorithms, 1993, Nad Honef, Germany. springer, 294, pp.133-144, LNCS. <http://link.springer.com/book/10.1007/3-540-57273-2>. <hal-01179730>
  • Olivier Devillers, Andreas Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. Workshop Algorithms and Data Structures, 1993, Montreal, Canada. springer, 709, pp.277-288, LNCS. <http://link.springer.com/book/10.1007/3-540-57155-8>. <hal-01179721>
  • Jean-Daniel Boissonnat, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec. Computing the whole set of Connolly Surfaces. Annual Conference of the Molecular Graphics Society, 1993, ~, France. <hal-01179713>
  • Jean-Daniel Boissonnat, Olivier Devillers, Jacqueline Duquesne. Computing Connolly Surfaces. IFIP Conference on Algorithms and efficient computation, 1992, ?, France. <hal-01180152>
  • Olivier Devillers, Stefan Meiser, Monique 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, <http://www.cccg.ca/>. <hal-01180157>
  • Jean-Daniel Boissonnat, Olivier Devillers, Leonbattista Donati, Franco Preparata. Motion planning for a spider robot. IEEE International Conference on Robotics and Automation, 1992, Nice, France. IEEE, pp.2321-2326. <hal-01179898>
  • Jean-Daniel Boissonnat, Olivier Devillers, Leonbattista Donati, Franco Preparata. Stable placements of spider robots. Annual Symposium on Computational Geometry, 1992, Berlin, Germany. ACM, pp.242-250. <hal-01179904>
  • Jean-Daniel Boissonnat, André Cerezo, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec. 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. <http://www.cccg.ca/>. <hal-01179732>
  • Olivier Devillers, Naji Mouawad. Guarding Vertices versus Guarding Edges in a Simple Polygon. 4th Canadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.99-102, 1992. <hal-01117277>
  • Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata. Computing the Union of 3-Colored Triangles. System Modelling and Optimization, 1991, Zurich, Switzerland. 180, pp.85-93, Lecture Notes in Control and Information Science. <http://link.springer.com/book/10.1007/BFb0113266>. <hal-01180155>
  • Olivier Devillers. Simple randomized $O(n \log^{*} n)$ algorithms. Canadian Conference on Computational Geometry, 1991, Burnaby, Canada. pp.141-144, <http://www.cccg.ca/>. <hal-01180162>
  • Jean-Daniel Boissonnat, André Cerezo, Olivier Devillers, Monique Teillaud. 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, <http://www.cccg.ca/>. <hal-01180159>
  • Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec. On-line geometric algorithms with good expected behaviours. 3th World Congress on Computation and Applied Mathematics, 1991, ~, France. pp.137-139. <hal-01180161>
  • Olivier Devillers, Stefan Meiser, Monique Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. Workshop Algorithms and Data Structures, 1991, Ottawa, Canada. springer, 519, pp.42-53, LNCS. <http://link.springer.com/book/10.1007/BFb0028243>. <hal-01180164>
  • Jean-Daniel Boissonnat, Olivier Devillers, Monique 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, <http://www.cccg.ca/>. <hal-01180166>
  • Olivier Devillers. The Macro-Regions,an Efficient Space Subdivision Structure for Ray Tracing. Eurographics, 1989, Hambourg, Germany. pp.27-38. <hal-01180225>
  • Olivier Devillers. Tools to Study the Efficiency of Space Subdivision Structures for Ray Tracing. PIXIM, 1989, Paris, France. pp.467-481. <hal-01180228>

Poster4 documents

  • Olivier Devillers, Marc Glisse, Rémy Thomasse. 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. <hal-01015598>
  • Olivier Devillers, Philippe Duchon, Rémy Thomasse. 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. <hal-01015603>
  • Nicolas Broutin, Olivier Devillers, Ross Hemsley. 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. <hal-01018187>
  • Mikhail Bogdanov, Olivier Devillers, Monique Teillaud. Tiling the hyperbolic plane. Bending Reality: Where art and science meet, 2013, Dagstuhl, Wadern, Germany. <hal-01018725>

Document associé à des manifestations scientifiques2 documents

  • Luca Castelli Aleardi, Olivier Devillers, Eric Fusy. Crossing-free straight-line drawing of graphs on the flat torus. Workshop on Geometric Structures with Symmetry and Periodicity, 2014, Kyoto, Japan. <hal-01018627>
  • Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Shewchuk. Vertex Deletion for 3D Delaunay Triangulations. ACM. 45th ACM Symposium on the Theory of Computing - STOC 2013, 2013, Palo Alto, United States. 2013. <hal-00963520>

Chapitre d'ouvrage2 documents

Direction d'ouvrage, Proceedings3 documents

Autre publication1 document

  • Olivier Devillers, Jean-Michel Moreau. Gedeon. Lettre d'information. 1999. <hal-00925755>

Rapport99 documents

  • Nicolas Chenavier, Olivier Devillers. Stretch Factor of Long Paths in a planar Poisson-Delaunay Triangulation. [Research Report] RR-8935, Inria. 2016, pp.34. <hal-01346203>
  • Olivier Devillers, Louis Noizet. Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path. [Research Report] RR-8946, INRIA Nancy. 2016. <hal-01353585>
  • Pedro Machado Manhães de Castro, Olivier Devillers. Expected Length of the Voronoi Path in a High Dimensional Poisson-Delaunay Triangulation. [Research Report] RR-8947, Inria. 2016. <hal-01353735>
  • Olivier Devillers, Ross Hemsley. The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$. [Research Report] RR-8792, INRIA. 2015, pp.25. <hal-01216212>
  • Olivier Devillers, Menelaos Karavelas, Monique Teillaud. Qualitative Symbolic Perturbation: a new geometry-based perturbation framework. [Research Report] RR-8153, INRIA. 2015, pp.34. <hal-00758631v4>
  • Olivier Devillers, Marc Glisse, Xavier Goaoc, Rémy Thomasse. Smoothed complexity of convex hulls by witnesses and collectors. [Research Report] 8787, INRIA. 2015, pp.41. <hal-01214021v2>
  • Olivier Devillers, Philippe Duchon, Rémy Thomasse. A generator of random convex polygons in a disc. [Research Report] RR-8467, INRIA. 2014, pp.9. <hal-00943409>
  • Olivier Devillers, Marc Glisse, Rémy Thomasse. A convex body with chaotic random convex hull. [Research Report] RR-8437, INRIA. 2013. <hal-00922515>
  • Luca Castelli Aleardi, Olivier Devillers, Eric Fusy. Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings. [Research Report] RR-7989, INRIA. 2012. <hal-00705181>
  • Olivier Devillers, Marc Glisse, Xavier Goaoc, Guillaume Moroz, Matthias Reitzner. The monotonicity of f-vectors of random polytopes. [Research Report] RR-8154, INRIA. 2012, pp.10. <hal-00758686>
  • Nicolas Broutin, Olivier Devillers, Ross Hemsley. A cone can help you find your way in a Poisson Delaunay triangulation. [Research Report] RR-8194, INRIA. 2012. <hal-00769529v2>
  • Mikhail Bogdanov, Olivier Devillers, Monique Teillaud. Hyperbolic Delaunay complexes and Voronoi diagrams made practical. [Research Report] RR-8146, INRIA. 2012. <hal-00756522v2>
  • Olivier Devillers, Marc Glisse, Xavier Goaoc. Complexity analysis of random geometric structures made simpler. [Research Report] RR-8168, INRIA. 2012. <hal-00761171>
  • Luca Castelli Aleardi, Olivier Devillers, Jarek Rossignac. ESQ: Editable SQuad representation for triangle meshes. [Research Report] RR-8066, INRIA. 2012. <hal-00731322>
  • Dominique Attali, Ulrich Bauer, Olivier Devillers, Marc Glisse, André Lieutier. Homological reconstruction and simplification in R3. [Research Report] RR-8169, INRIA. 2012. <hal-00761208>
  • Luca Castelli Aleardi, Olivier Devillers. Explicit array-based compact data structures for triangulations. [Research Report] RR-7736, INRIA. 2011, pp.20. <inria-00623762v2>
  • Olivier Devillers. Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time. [Research Report] RR-7299, INRIA. 2010, pp.10. <inria-00485915v2>
  • Pedro Machado Manhães de Castro, Olivier Devillers. Walking Faster in a Triangulation. [Research Report] RR-7322, Inria. 2010, pp.15. <inria-00493046>
  • Pedro Machado Manhães de Castro, Olivier Devillers. On the Size of Some Trees Embedded in Rd. [Research Report] RR-7179, INRIA. 2010. <inria-00448335>
  • Olivier Devillers. Vertex Removal in Two Dimensional Delaunay Triangulation: Asymptotic Complexity is Pointless. [Research Report] RR-7104, INRIA. 2009, pp.15. <inria-00433107>
  • Dominique Attali, Olivier Devillers, Xavier Goaoc. The Effect of Noise on the Number of Extreme Points. [Research Report] RR-7134, INRIA. 2009, pp.24. <inria-00438409>
  • Pedro De Castro, Olivier Devillers. Self-Adapting Point Location. [Research Report] RR-7132, INRIA. 2009, pp.24. <inria-00438486v3>
  • Olivier Devillers, Pedro Machado Manhães de Castro. State of the Art: Updating Delaunay Triangulations for Moving Points. [Research Report] RR-6665, INRIA. 2008, pp.12. <inria-00325816>
  • Nina Amenta, Dominique Attali, Olivier Devillers. A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron. [Research Report] RR-6522, -; INRIA. 2008. <inria-00277899v2>
  • Olivier Devillers. Géométrie algorithmique et réseaux. [Research Report] RR-6514, INRIA. 2008. <inria-00275272v2>
  • Pedro Machado Manhães de Castro, Olivier Devillers. Delaunay Triangulations for Moving Points. [Research Report] RR-6750, INRIA. 2008. <inria-00344053>
  • Oswin Aichholzer, Olivier Devillers, Franz Aurenhammer, Thomas Hackl, Monique Teillaud, et al.. Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem. [Research Report] RR-6748, INRIA. 2008. <inria-00343651>
  • Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, et al.. On the Complexity of Umbra and Penumbra. [Research Report] RR-6347, INRIA. 2007, pp.28. <inria-00186262v2>
  • Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc. Helly-type theorems for approximate covering. [Research Report] RR-6342, INRIA. 2007, pp.12. <inria-00179277v3>
  • Olivier Devillers, Xavier Goaoc. Random sampling of a cylinder yields a not so nasty Delaunay triangulation. [Research Report] RR-6323, INRIA. 2007, pp.10. <inria-00179313v2>
  • Nina Amenta, Dominique Attali, Olivier Devillers. Complexity of Delaunay triangulation for points on lower-dimensional~polyhedra. [Research Report] RR-5986, INRIA. 2006, pp.12. <inria-00098300v2>
  • Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in Delaunay and Regular 3D Triangulations. [Research Report] RR-5968, INRIA. 2006, pp.11. <inria-00090522v2>
  • Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Optimal succinct representation of planar maps. [Research Report] RR-5803, INRIA. 2006, pp.26. <inria-00070221>
  • Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Dynamic updates of succinct triangulations. [Research Report] RR-5709, INRIA. 2006, pp.23. <inria-00070308>
  • Abdelkrim Mebarki, Pierre Alliez, Olivier Devillers. Farthest Point Seeding for Placement of Streamlines. [Research Report] RR-5524, INRIA. 2006, pp.28. <inria-00070483>
  • Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Compact representation of triangulations. [Research Report] RR-5433, INRIA. 2006, pp.20. <inria-00070574>
  • Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, et al.. Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Research Report] RR-5742, INRIA. 2005, pp.11. <inria-00077116>
  • Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen Wismath. Drawing $K_n$ in Three Dimensions with One Bend per Edge. [Research Report] RR-5708, INRIA. 2005. <inria-00071219>
  • Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, et al.. On the Number of Maximal Free Line Segments Tangent to Arbitrary Three-dimensional Convex Polyhedra. [Research Report] RR-5671, INRIA. 2005. <inria-00071226>
  • Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile. Lines tangent to four triangles in three-dimensional space. [Research Report] RR-5693, INRIA. 2005. <inria-00071223>
  • Luca Castelli Aleardi, Olivier Devillers. Canonical Triangulation of a Graph, with a Coding Application. RR-5231, INRIA. 2004, pp.24. <inria-00070765>
  • François Cayre, Olivier Devillers, Francis Schmitt, Henri Maître. Watermarking 3D triangle meshes for authentication and integrity. [Research Report] RR-5223, INRIA. 2004. <inria-00071257>
  • Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Lévy, Mathieu Desbrun. Anisotropic Polygonal Remeshing. [Research Report] RR-4808, INRIA. 2003. <inria-00071778>
  • Olivier Devillers, Philippe Guigue. Inner and Outer Rounding of Set Operations on Lattice Polygonal Regions. RR-5070, INRIA. 2003. <inria-00071513>
  • Olivier Devillers, Philippe Guigue. Finite Precision Elementary Geometric Constructions. RR-4559, INRIA. 2002. <inria-00072029>
  • Olivier Devillers, Philippe Guigue. Faster Triangle-Triangle Intersection Tests. RR-4488, INRIA. 2002. <inria-00072100>
  • Olivier Devillers, Ferran Hurtado, Carlos Seara. Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position. RR-4352, INRIA. 2002. <inria-00072236>
  • Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, et al.. The expected number of 3D visibility events is linear. [Research Report] RR-4671, INRIA. 2002. <inria-00071914>
  • Olivier Devillers, Monique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation. RR-4624, INRIA. 2002. <inria-00071961>
  • Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg. Isotropic Surface Remeshing. RR-4594, INRIA. 2002. <inria-00071991>
  • Olivier Devillers, Sylvain Pion. Efficient Exact Geometric Predicates for Delaunay Triangulations. RR-4351, INRIA. 2002. <inria-00072237>
  • Olivier Devillers. On the Number of Cylindrical Shells. RR-4234, INRIA. 2001. <inria-00072353>
  • Olivier Devillers, Bernard Mourrain, Franco Preparata, Philippe Trebuchet. On circular Cylinders by Four or Five Points in Space. RR-4195, INRIA. 2001. <inria-00072427>
  • Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, et al.. Splitting a Delaunay Triangulation in Linear Time. RR-4160, INRIA. 2001. <inria-00072462>
  • Olivier Devillers, Franco Preparata. Culling a Set of Points for Roundness or Cylindricity Evaluations. RR-4159, INRIA. 2001. <inria-00072463>
  • Olivier Devillers, Pierre-Marie Gandoin. Compression interactive de maillages triangulaires arbitraires. RR-4158, INRIA. 2001. <inria-00072464>
  • Olivier Devillers, Sylvain Pion, Monique Teillaud. Walking in a triangulation. RR-4120, INRIA. 2001. <inria-00072509>
  • Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro Ramos, et al.. Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. RR-4119, INRIA. 2001. <inria-00072510>
  • Olivier Devillers, Philippe Guigue. Le tampon mélangeur. [Rapport de recherche] RR-3988, INRIA. 2000, pp.38. <inria-00072658>
  • Olivier Devillers, Pierre-Marie Gandoin. Geometric Compression for Interactive Transmission. [Research Report] RR-3910, INRIA. 2000, pp.23. <inria-00072743>
  • Hervé Brönnimann, Olivier Devillers. The union of Unit Balls has Quadratic Complexity, even if They all Contain the Origin. RR-3758, INRIA. 1999. <inria-00072904>
  • Olivier Devillers, Franco Preparata. Evaluating the Cylindricity of a Nominally Cylindrical Point Set (Draft). RR-3747, INRIA. 1999. <inria-00072915>
  • Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud. Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs. RR-3826, INRIA. 1999. <inria-00072832>
  • Olivier Devillers, Pierre-Marie Gandoin. Compression géométrique pour une transmission progressive. RR-3766, INRIA. 1999. <inria-00072896>
  • Olivier Devillers. Computational Geometry and Discrete Computations. RR-3533, INRIA. 1998. <inria-00073152>
  • Olivier Devillers. On Deletion in Delaunay Triangulation. RR-3451, INRIA. 1998. <inria-00073239>
  • Olivier Devillers, Pierre-Marie Gandoin. Rounding Voronoi Diagram. RR-3481, INRIA. 1998. <inria-00073208>
  • Olivier Devillers, Franco Preparata. Further Results on Arithmetic Filters for Geometric Predicates. RR-3528, INRIA. 1998. <inria-00073157>
  • Olivier Devillers, Giuseppe Liotta, Franco Preparata, Roberto Tamassia. Checking the Convexity of Polytopes and the Planarity of Subdivisions. RR-3527, INRIA. 1998. <inria-00073158>
  • Olivier Devillers, Asish Mukhopadhyay. Finding an Ordinary Conic and an Ordinary Hyperplane. RR-3517, INRIA. 1998. <inria-00073167>
  • Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard. Motion Planning of Legged Robots. RR-3214, INRIA. 1997. <inria-00073475>
  • Olivier Devillers. Improved Incremental Randomized Delaunay Triangulation.. RR-3298, INRIA. 1997. <inria-00073390>
  • Pierre Alliez, Olivier Devillers, Jack Snoeyink. Removing Degeneracies by Perturbing the Problem or the World. RR-3316, INRIA. 1997. <inria-00073373>
  • Olivier Devillers, Matthew J. Katz. Optimal Line Bipartitions of Point Sets. RR-2871, INRIA. 1996. <inria-00073820>
  • Mark De Berg, Olivier Devillers, Marc Van Kreveld, Otfried Schwarzkopf, Monique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations. RR-2832, INRIA. 1996. <inria-00073859>
  • Luc Tancredi, Monique Teillaud, Olivier Devillers. Symbolic Elimination for Parallel Manipulators. RR-2809, INRIA. 1996. <inria-00073883>
  • Olivier Devillers, Franco Preparata. A Probabilistic Analysis of the Power of Arithmetic Filters. RR-2971, INRIA. 1996. <inria-00073727>
  • Mark De Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf. Computing a Single Cell in the Union of two Simple Polygons. RR-2626, INRIA. 1995. <inria-00074061>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. Computing Largest Circles Separating Two Sets of Segments. RR-2705, INRIA. 1995. <inria-00073985>
  • Olivier Devillers, Mordecai Golin. Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas. [Research Report] RR-2280, INRIA. 1994. <inria-00074391>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec. Convex Tours of Bounded Curvature. [Research Report] RR-2375, INRIA. 1994. <inria-00074301>
  • Olivier Devillers, Mordecai Golin. Dog bites postman: point location in the moving Voronoi diagram and related problems. [Research Report] RR-2263, INRIA. 1994. <inria-00074408>
  • Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata, Mariette Yvinec. Evaluating signs of determinants using single-precision arithmetic. [Research Report] RR-2306, INRIA. 1994. <inria-00074367>
  • Olivier Devillers, Mordecai Golin, Klara Kedem, Stefan Schirra. Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. [Research Report] RR-2329, INRIA. 1994. <inria-00074345>
  • Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec. Circular Separability of Polygons. RR-2406, INRIA. 1994. <inria-00074269>
  • Olivier Devillers, Andreas Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. [Research Report] RR-1882, INRIA. 1993. <inria-00074791>
  • Jean-Daniel Boissonnat, André Cerezo, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec. An Algorithm for constructing the convex hull of a set of spheres in dimension d. [Research Report] RR-2080, INRIA. 1993. <inria-00074591>
  • Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata, Leonbattista Donati. Motion planning of legged robots : the spider robot problem. [Research Report] RR-1767, INRIA. 1992. <inria-00077007>
  • Olivier Devillers. Robust and efficient implementation of the Delaunay tree. [Research Report] RR-1619, INRIA. 1992, pp.11. <inria-00074942>
  • Olivier Devillers, Stefan Meiser, Monique Teillaud. The space of spheres, a geometric tool to unify duality results on Voronoi diagrams. [Research Report] RR-1620, INRIA. 1992. <inria-00074941>
  • Jean-Daniel Boissonnat, André Cerezo, Olivier Devillers, Monique Teillaud. Output sensitive construction of the 3D Delaunay triangulation of constrained sets of points. [Research Report] RR-1415, INRIA. 1991. <inria-00075145>
  • Olivier Devillers, Monique Teillaud, Mariette Yvinec. Dynamic location in an arrangement of line segments in the plane. [Research Report] RR-1558, INRIA. 1991. <inria-00075003>
  • Olivier Devillers. Randomization yields simple 0(n log\* n) algorithms for difficult (n) problems. [Research Report] RR-1412, INRIA. 1991, pp.15. <inria-00075148>
  • Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud. A dynamic construction of higher order Voronoi diagrams and its randomized analysis. [Research Report] RR-1207, INRIA. 1990. <inria-00075351>
  • Jean-Daniel Boissonnat, Olivier Devillers, Franco Preparata. Computing the union of 3-colored triangles. [Research Report] RR-1293, INRIA. 1990. <inria-00075266>
  • Olivier Devillers, Stéphane Meiser, Monique Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation. [Research Report] RR-1349, INRIA. 1990. <inria-00075210>
  • Olivier Devillers. Simultaneous containment of several polygons : analysis of the contact configurations. [Research Report] RR-1179, INRIA. 1990. <inria-00075379>
  • Jean-Daniel Boissonnat, Olivier Devillers, Rene Schott, Monique Teillaud, Mariette Yvinec. Applications of random sampling to on-line algorithms in computational geometry. [Research Report] RR-1285, INRIA. 1990. <inria-00075274>
  • Olivier Devillers, Claude Puech, François X. Sillion. CIL : un modèle d’illumination intégrant les réflexions diffuse et spéculaire. [Rapport de recherche] Laboratoire d'Informatique de l'École Normale Supérieure. 1987. <hal-01117282>