The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Olivier Devillers: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Olivier Devillers, Sylvain Pion
    Efficient Exact Geometric Predicates for Delauny Triangulations. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:37-44 [Conf]
  2. Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
    Dynamic updates of succinct triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:134-137 [Conf]
  3. Pierre Alliez, Olivier Devillers, Jack Snoeyink
    Removing degeneracies by perturbing the problem or perturbing the world. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  4. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
    Computing Largest Circles Separating Two Sets of Segments. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:173-178 [Conf]
  5. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    On the number of lines tangent to four convex polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:113-117 [Conf]
  6. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
    On the number of line tangents to four triangles in three-dimensional space. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:184-187 [Conf]
  7. Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Steve Wismath
    Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:302-305 [Conf]
  8. Olivier Devillers, Philippe Guigue
    The shuffling buffer. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:77-80 [Conf]
  9. Olivier Devillers, Mordecai J. Golin
    Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:153-158 [Conf]
  10. Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra
    Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:122-127 [Conf]
  11. Olivier Devillers, Ferran Hurtado, Mercè Mora, Carlos Seara
    Separating several point sets in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:81-84 [Conf]
  12. Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
    Optimal succinct representations of planar maps. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:309-318 [Conf]
  13. Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
    Evaluation of a New Method to Compute Signs of Determinants. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  14. Jean-Daniel Boissonnat, Frédéric Cazals, Frank Da, Olivier Devillers, Sylvain Pion, François Rebufat, Monique Teillaud, Mariette Yvinec
    Programming with CGAL: The Example of Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:421-422 [Conf]
  15. Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
    Stable Placements for Spider Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:242-250 [Conf]
  16. Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud, Mariette Yvinec
    Triangulations in CGAL (extended abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:11-18 [Conf]
  17. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    The number of lines tangent to arbitrary convex polyhedra in 3D. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:46-55 [Conf]
  18. Olivier Devillers
    Improved Incremental Randomized Delaunay Triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:106-115 [Conf]
  19. Olivier Devillers
    On Deletion in Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:181-188 [Conf]
  20. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud
    Algebraic methods and arithmetic filtering for exact predicates on circle arcs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:139-147 [Conf]
  21. Olivier Devillers, Philippe Guigue
    Inner and outer rounding of set operations on lattice polygonal regions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:429-437 [Conf]
  22. Olivier Devillers, Sylvain Pion, Monique Teillaud
    Walking in a triangulation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:106-114 [Conf]
  23. Julien Demouth, Olivier Devillers, Hazel Everett, Marc Glisse, Sylvain Lazard, Raimund Seidel
    Between umbra and penumbra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:265-274 [Conf]
  24. Olivier Devillers
    Computational geometry and discrete computations. [Citation Graph (0, 0)][DBLP]
    DGCI, 1996, pp:317-324 [Conf]
  25. Olivier Devillers, Pierre-Marie Gandoin
    Rounding Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    DGCI, 1999, pp:375-387 [Conf]
  26. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec
    Convex Tours on Bounded Curvature. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:254-265 [Conf]
  27. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud
    Splitting a Delaunay Triangulation in Linear Time. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:312-320 [Conf]
  28. Olivier Devillers, Mordecai J. Golin
    Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:133-144 [Conf]
  29. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud
    Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:117-120 [Conf]
  30. Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Stephen K. Wismath
    Drawing Kn in Three Dimensions with One Bend Per Edge. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:83-88 [Conf]
  31. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
    From Spider Robots to Half Disk Robots. [Citation Graph (0, 0)][DBLP]
    ICRA, 1994, pp:953-958 [Conf]
  32. Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud
    Computing the Maximum Overlap of Two Convex Polygons Under Translations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:126-135 [Conf]
  33. Olivier Devillers, Matthew J. Katz
    Optimal Line Bipartitions of Point Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:45-54 [Conf]
  34. Pierre-Marie Gandoin, Olivier Devillers
    Progressive lossless compression of arbitrary simplicial complexes. [Citation Graph (0, 0)][DBLP]
    SIGGRAPH, 2002, pp:372-379 [Conf]
  35. Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg
    Isotropic Surface Remeshing. [Citation Graph (0, 0)][DBLP]
    Shape Modeling International, 2003, pp:49-58 [Conf]
  36. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
    Circular Separability of Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:273-281 [Conf]
  37. Olivier Devillers, Franco P. Preparata
    Evaluating the cylindricity of a nominally cylindrical point set. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:518-527 [Conf]
  38. Olivier Devillers, Monique Teillaud
    Perturbations and vertex removal in a 3D delaunay triangulation. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:313-319 [Conf]
  39. Olivier Devillers, Pierre-Marie Gandoin
    Geometric compression for interactive transmission. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2000, pp:319-326 [Conf]
  40. Abdelkrim Mebarki, Pierre Alliez, Olivier Devillers
    Farthest Point Seeding for Efficient Placement of Streamlines. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2005, pp:61- [Conf]
  41. Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer
    Succinct Representation of Triangulations with a Boundary. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:134-145 [Conf]
  42. Olivier Devillers, Andreas Fabri
    Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:277-288 [Conf]
  43. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:186-199 [Conf]
  44. Olivier Devillers, Stefan Meiser, Monique Teillaud
    Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:42-53 [Conf]
  45. Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata, Mariette Yvinec
    Evaluating Signs of Determinants Using Single-Precision Arithmetic. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:2, pp:111-132 [Journal]
  46. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
    Circular Separability of Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:1, pp:67-82 [Journal]
  47. Jean-Daniel Boissonnat, Olivier Devillers, Monique Teillaud
    A Semidynamic Construction of Higher-Order Voronoi Diagrams and Its Randomized Analysis. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:4, pp:329-356 [Journal]
  48. Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud
    Splitting a Delaunay Triangulation in Linear Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:39-46 [Journal]
  49. Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers, Jacqueline Duquesne, Mariette Yvinec
    An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:123-130 [Journal]
  50. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec
    Convex tours of bounded curvature. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:3, pp:149-159 [Journal]
  51. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Pion, Monique Teillaud, Mariette Yvinec
    Triangulations in CGAL. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:22, n:1-3, pp:5-19 [Journal]
  52. Olivier Devillers, Alexandra Fronville, Bernard Mourrain, Monique Teillaud
    Algebraic methods and arithmetic filtering for exact predicates on circle arcs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:22, n:1-3, pp:119-142 [Journal]
  53. Olivier Devillers, Philippe Guigue
    Inner and outer rounding of Boolean operations on lattice polygonal regions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:33, n:1-2, pp:3-17 [Journal]
  54. Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra
    Queries on Voronoi Diagrams of Moving Points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:315-327 [Journal]
  55. Olivier Devillers, Ferran Hurtado, Gyula Károlyi, Carlos Seara
    Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:3, pp:193-208 [Journal]
  56. Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
    Checking the convexity of polytopes and the planarity of subdivisions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:187-208 [Journal]
  57. Olivier Devillers, Stefan Meiser, Monique Teillaud
    Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:55-80 [Journal]
  58. Olivier Devillers, Franco P. Preparata
    Further results on arithmetic filters for geometric predicates. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:2, pp:141-148 [Journal]
  59. Olivier Devillers
    Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  60. Olivier Devillers
    On Deletion in Delaunay Triangulation [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  61. Olivier Devillers
    Improved Incremental Randomized Delaunay Triangulation [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  62. Hervé Brönnimann, Olivier Devillers
    The union of unit balls has quadratic complexity, even if they all contain the origin [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  63. Olivier Devillers, Franco P. Preparata
    Further Results on Arithmetic Filters for Geometric Predicates [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  64. Olivier Devillers, Franco P. Preparata
    A Probabilistic Analysis of the Power of Arithmetic Filters [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  65. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec
    Convex Tours of Bounded Curvature [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  66. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
    Computing largest circles separating two sets of segments [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  67. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
    Motion Planning of Legged Robots [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  68. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Mariette Yvinec
    Circular Separability of Polygons [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  69. Olivier Devillers, Asish Mukhopadhyay
    Finding an ordinary conic and an ordinary hyperplane [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  70. Olivier Devillers, Pierre-Marie Gandoin
    Geometric compression for progressive transmission [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  71. Pierre Alliez, Éric Colin de Verdière, Olivier Devillers, Martin Isenburg
    Centroidal Voronoi diagrams for isotropic surface remeshing. [Citation Graph (0, 0)][DBLP]
    Graphical Models, 2005, v:67, n:3, pp:204-231 [Journal]
  72. Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec
    Applications of Random Sampling to On-line Algorithms in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:51-71 [Journal]
  73. Olivier Devillers
    The Number of Cylindrical Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:3, pp:453-458 [Journal]
  74. Olivier Devillers, Franco P. Preparata
    A Probabilistic Analysis of the Power of Arithmetic Filters. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:4, pp:523-547 [Journal]
  75. Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers, Monique Teillaud
    Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:1-14 [Journal]
  76. Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec
    Computing Largest Circles Separating Two Sets of Segments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:41-53 [Journal]
  77. Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
    Motion planning of legged robots: the spider robot problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:3-20 [Journal]
  78. Jean-Daniel Boissonnat, Olivier Devillers, Franco P. Preparata
    Computing the union of 3-colored triangles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:2, pp:187-196 [Journal]
  79. Olivier Devillers
    On Deletion in Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:3, pp:193-206 [Journal]
  80. Olivier Devillers
    Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:1, pp:97-111 [Journal]
  81. Olivier Devillers
    Simultaneous containment of several polygons: analysis of the contact configurations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:4, pp:429-442 [Journal]
  82. Olivier Devillers, Regina Estkowski, Pierre-Marie Gandoin, Ferran Hurtado, Pedro A. Ramos, Vera Sacristan
    Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:5, pp:391-398 [Journal]
  83. Olivier Devillers, Andreas Fabri
    Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:4, pp:487-506 [Journal]
  84. Olivier Devillers, Philippe Guigue
    The Shuffling Buffer. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:5, pp:555-572 [Journal]
  85. Olivier Devillers, Mordecai J. Golin
    Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:321-342 [Journal]
  86. Olivier Devillers, Matthew J. Katz
    Optimal Line Bipartitions of Point Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:39-51 [Journal]
  87. Olivier Devillers, Franco P. Preparata
    Culling a Set of Points for Roundness or Cylindricity Evaluations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:3, pp:231-240 [Journal]
  88. Olivier Devillers, Pedro A. Ramos
    Computing Roundness is Easy if the Set is Almost Round. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:3, pp:229-248 [Journal]
  89. Olivier Devillers
    The Delaunay Hierarchy. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:2, pp:163-180 [Journal]
  90. Olivier Devillers, Sylvain Pion, Monique Teillaud
    Walking in a Triangulation. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:2, pp:181-199 [Journal]
  91. Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf
    Computing a Single Cell in the Overlay of Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:215-219 [Journal]
  92. Olivier Devillers, Mordecai J. Golin
    Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:3, pp:157-164 [Journal]
  93. Mark de Berg, Otfried Cheong, Olivier Devillers, Marc J. van Kreveld, Monique Teillaud
    Computing the Maximum Overlap of Two Convex Polygons under Translations. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:5, pp:613-628 [Journal]
  94. Olivier Devillers, Asish Mukhopadhyay
    Finding an Ordinary Conic and an Ordinary Hyperplane. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:4, pp:462-468 [Journal]
  95. Pierre Alliez, Olivier Devillers, Jack Snoeyink
    Removing Degeneracies by Perturbing the Problem or Perturbing the World. [Citation Graph (0, 0)][DBLP]
    Reliable Computing, 2000, v:6, n:1, pp:61-79 [Journal]
  96. Jean-Daniel Boissonnat, Olivier Devillers, Sylvain Lazard
    Motion Planning of Legged Robots. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:218-246 [Journal]
  97. Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean
    The Expected Number of 3D Visibility Events Is Linear. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1586-1620 [Journal]
  98. Olivier Devillers
    An Introduction to Randomization in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:157, n:1, pp:35-52 [Journal]
  99. Olivier Devillers, Pierre-Marie Gandoin
    Rounding Voronoi diagram. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:283, n:1, pp:203-221 [Journal]
  100. Pierre Alliez, David Cohen-Steiner, Olivier Devillers, Bruno Lévy, Mathieu Desbrun
    Anisotropic polygonal remeshing. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 2003, v:22, n:3, pp:485-493 [Journal]
  101. Pierre-Marie Gandoin, Olivier Devillers
    Progressive lossless compression of arbitrary simplicial complexes. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 2002, v:21, n:3, pp:372-379 [Journal]
  102. Abdelkrim Mebarki, Luca Castelli Aleardi, Olivier Devillers
    2D Triangulation Representation Using Stable Catalogs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  103. Nina Amenta, Dominique Attali, Olivier Devillers
    Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1106-1113 [Conf]
  104. Olivier Devillers, Philippe Guigue
    Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  105. Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
    Lines Tangent to Four Triangles in Three-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:369-380 [Journal]
  106. Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
    Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:522-551 [Journal]

  107. Oja medians and centers of gravity. [Citation Graph (, )][DBLP]


  108. Helly-type theorems for approximate covering. [Citation Graph (, )][DBLP]


  109. Predicates for line transversals to lines and line segments in three-dimensional space. [Citation Graph (, )][DBLP]


  110. Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension. [Citation Graph (, )][DBLP]


  111. Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation. [Citation Graph (, )][DBLP]


  112. Empty-ellipse graphs. [Citation Graph (, )][DBLP]


  113. Filtering Relocations on a Delaunay Triangulation. [Citation Graph (, )][DBLP]


  114. On the complexity of umbra and penumbra. [Citation Graph (, )][DBLP]


  115. Helly-Type Theorems for Approximate Covering. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002