Olivier Devillers
Présentation
Publications
Publications
|
|
Randomisation, sphères et déplacements de robotsInformatique [cs]. Université Nice Sophia Antipolis, 1993 |
|
|
Méthodes d'optimisation du tracé de rayonsSynthèse d'image et réalité virtuelle [cs.GR]. Université Paris Sud - Paris XI, 1988. Français. ⟨NNT : ⟩ |
|
|
Compact data structures for triangulationsEncyclopedia of Algorithms, Springer, 2015, ⟨10.1007/978-3-642-27848-8_589-1⟩ |
|
|
Delaunay triangulation and randomized constructionsEncyclopedia of Algorithms, Springer, 2014, ⟨10.1007/978-3-642-27848-8_711-1⟩ |
|
|
A Subquadratic Algorithm for Computing the L1-distance between Two TerrainsSymposium on Computational Geometry (SoCG), Jun 2025, Kanazawa, Japan. pp.4:1-4:17, ⟨10.4230/LIPIcs.SoCG.2025.4⟩ |
|
|
SCARST: Schnyder Compact and Regularity Sensitive Triangulation Data Structure40th International Symposium on Computational Geometry (SoCG 2024), Jun 2024, Athens, Greece. ⟨10.4230/LIPIcs.SoCG.2024.32⟩ |
|
|
Stochastic Analysis of Empty-Region GraphsCCCG 2021 - 33rd Canadian Conference on Computational Geometry, Aug 2021, Halifax / Virtual, Canada |
Walking in random Delaunay triangulationsStochastic Geometry Days, Nov 2021, Dunkerque, France |
|
|
|
Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ GraphsEuroCG 2020 - 36th European Workshop on Computational Geometry, Mar 2020, Würzburg, Germany |
|
|
Hardness results on Voronoi, Laguerre and Apollonius diagramsCCCG 2019 - Canadian Conference on Computational Geometry, Aug 2019, Edmonton, Canada |
|
|
A Poisson sample of a smooth surface is a good sampleEuroCG 2019 - 35th European Workshop on Computational Geometry, Mar 2019, Utrecht, Netherlands |
|
|
Randomized incremental construction of Delaunay triangulations of nice point setsESA 2019 - 27th Annual European Symposium on Algorithms, Sep 2019, Munich, Germany. ⟨10.4230/LIPIcs.ESA.2019.22⟩ |
|
|
3D Snap RoundingProceedings of the 34th International Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.30:1 - 30:14, ⟨10.4230/LIPIcs.SoCG.2018.30⟩ |
|
|
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⟩ |
|
|
Qualitative Symbolic PerturbationProceedings of the 32nd International Symposium on Computational Geometry, Jun 2016, Boston, United States. pp.33:1-33:15, ⟨10.4230/LIPIcs.SoCG.2016.33⟩ |
|
|
On the smoothed complexity of convex hullsProceedings of the 31st International Symposium on Computational Geometry, Jun 2015, Eindhoven, Netherlands. pp.224-238, ⟨10.4230/LIPIcs.SOCG.2015.224⟩ |
|
|
Efficiently Navigating a Random Delaunay TriangulationAofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France |
|
|
Recognizing shrinkable complexes is NP-completeESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩ |
|
|
Hyperbolic Delaunay Complexes and Voronoi Diagrams Made PracticalProceedings of the 29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.67-76, ⟨10.1145/2462356.2462365⟩ |
|
|
Homological Reconstruction and Simplification in R3SoCG 2013 - 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩ |
|
|
Complexity Analysis of Random Geometric Structures Made Simpler29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.167-175, ⟨10.1145/2462356.2462362⟩ |
|
|
Vertex Deletion for 3D Delaunay TriangulationsProceedings of the 21st European Symposium on Algorithms, 2013, Sophia Antipolis, France. pp.253-264, ⟨10.1007/978-3-642-40450-4_22⟩ |
|
|
Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-line DrawingsGraph Drawing - 20th International Symposium, GD 2012, Sep 2012, Redmond, WA, United States. pp.376-387, ⟨10.1007/978-3-642-36763-2_34⟩ |
|
|
Delaunay triangulations, theory vs practice.EuroCG, 28th European Workshop on Computational Geometry, 2012, Assisi, Italy |
|
|
ESQ: Editable SQuad Representation for Triangle Meshes25th SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2012, Aug 2012, Ouro Preto, Brazil. pp.110-117, ⟨10.1109/SIBGRAPI.2012.24⟩ |
|
|
Delaunay triangulation of imprecise points, preprocess and actually get a fast query timeXIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain |
|
|
Hyperbolic Delaunay triangulations and Voronoi diagrams made practicalXIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain |
Explicit array-based compact data structures for planar and surface meshesXIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain |
|
|
|
Explicit array-based compact data structures for triangulations22nd International Symposium on Algorithms and Computation, 2011, Yokohama, Japan. pp.312--322 |
Simple and Efficient Distribution-Sensitive Point Location in TriangulationsProceedings of the 13th Workshop on Algorithm Engineering and Experiments, 2011, San Francisco, United States. pp.127-138 |
|
A Pedagogic JavaScript Program for Point Location Strategies27th Annual Symposium on Computational Geometry (Video), 2011, Paris, France. pp.295-296, ⟨10.1145/1998196.1998244⟩ |
|
|
|
Oja Medians and Centers of Gravity22th Canadian Conference on Computational Geometry, Aug 2010, Winnipeg, Canada |
|
|
Fast Delaunay Triangulation for Converging Point Relocation SequencesEuropean Workshop on Computational Geometry, 2009, Bruxelles, Belgium |
|
|
Lower and upper bounds on the number of empty cylinders and ellipsoidsEuropean Workshop on Computational Geometry, Mar 2009, Bruxelles, Belgium. pp.139-142 |
|
|
Incremental construction of the Delaunay graph in medium dimensionProceedings of the 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, ⟨10.1145/1542362.1542403⟩ |
Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh GenerationProceedings of the 16th International Meshing Roundtable, Oct 2007, Seattle, United States. pp.83-101, ⟨10.1007/978-3-540-75103-8_5⟩ |
|
|
|
Predicates for line transversals to lines and line segments in three-dimensional spaceSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩ |
|
|
Empty-ellipse graphs19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256 |
|
|
Helly-type theorems for approximate coveringSoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128 |
|
|
Complexity of Delaunay Triangulation for Points on Lower-dimensional~PolyhedraACM-SIAM Symposium on Discrete Algorithms, Jan 2007, New Orleans, United States. pp.1106--1113 |
|
|
Between umbra and penumbraProceedings 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⟩ |
|
|
2D Triangulation Representation Using Stable CatalogsProc. 18th Canadian Conference on Computational Geometry, Aug 2006, Kingston, Canada, France |
|
|
Optimal Succinct Representations of Planar MapsProceedings of the 22nd Annual Symposium on Computational Geometry, Jun 2006, Sedona, Arizona, United States. ⟨10.1145/1137856.1137902⟩ |
|
|
Succinct representation of triangulations with a boundary9th Workshop on Algorithms and Data Structures, Aug 2005, Waterloo, Canada, pp.134--135 |
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge13th International Symposium on Graph Drawing - GD'2005, Sep 2005, University of Limerick, Ireland |
|
|
Accurate Interactive Specular Reflections on Curved ObjectsVision Modeling and Visualization (VMV 2005), Nov 2005, Erlangen, Germany. pp.8 |
|
|
Dynamic updates of succinct triangulations18th Canadian Conference on Computational Geometry, 2005, Windsor, Canada, France |
|
|
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint17th Canadian Conference on Computational Geometry - CCCG'2005, Aug 2005, Windsor, Canada |
|
|
The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3DProceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩ |
|
|
On the number of line tangents to four triangles in three-dimensional space16th Canadian Conference on Computational Geometry - CCCG'04, 2004, Montreal, Canada, 4 p |
Inner and outer rounding of set operations on lattice polygonal regionsProceedings of the 20th Annual Symposium on Computational geometry, 2004, Brooklynn, United States. pp.429-437, ⟨10.1145/997817.997881⟩ |
|
|
|
Perturbations and Vertex Removal in a 3D Delaunay TriangulationProceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, Baltimore, MA, United States. pp.313--319 |
|
|
Compression de maillages, un état de l’artCORESA, 2003, Lyon, France |
|
|
Transmission progressive de modèles triangulés sur le réseauCORESA, Jan 2003, Lyon, France |
|
|
Isotropic Surface RemeshingInternational Conference on Shape Modeling and applications,, May 2003, Seoul, South Korea |
|
|
Efficient Exact Geometric Predicates for Delaunay TriangulationsProceedings of the 5th Workshop on Algorithm Engineering and Experiments, Jan 2003, Baltimore, Maryland, United States. pp.37-44 |
|
|
On the Number of Lines Tangent to Four Convex Polyhedra14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada |
The shuffling buffer13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada |
|
|
|
Splitting a Delaunay Triangulation in Linear TimeProceedings of the 8th European Symposium on Algorithms, 2001, Aarhus, Denmark. pp.312-320, ⟨10.1007/3-540-44676-1_26⟩ |
Separating Several Point Sets in the Plane13th Canadian Conference on Computational Geometry, 2001, Waterloo, Canada |
|
|
|
Walking in a TriangulationProceedings of the 17th Annual Symposium on Computational Geometry, Jun 2001, Boston, United States. pp.106-114, ⟨10.1145/378583.378643⟩ |
|
|
Evaluating the cylindricity of a nominally cylindrical point setProceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, Jan 2000, San Francisco, United States |
|
|
Geometric compression for interactive transmissionProceedings of the conference on Visualization '00, 2000, Salt Lake City, United States. pp.319-326, ⟨10.1109/VISUAL.2000.885711⟩ |
|
|
Algebraic methods and arithmetic filtering for exact predicates on circle arcsProceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.139-147, ⟨10.1145/336154.336194⟩ |
|
|
Triangulations in CGALProceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.11-18, ⟨10.1145/336154.336165⟩ |
|
|
On deletion in Delaunay triangulationsProceedings of the 15th Annual Symposium on Computational Geometry, 1999, Miami, United States. pp.181-189, ⟨10.1145/304893.304969⟩ |
|
|
Programming with CGAL: the example of triangulations8th Annual Video Review of Computational Geometry, 15th ACM Symposium on Computational Geometry (SCG), Jun 1999, Miami Beach, Florida, United States |
Rounding Voronoi DiagramDiscrete Geometry and Computational Imagery, 1999, Noisy le grand, France. pp.375-387 |
|
Removing Degeneracies by Perturbing the Problem or the WorldCanadian Conference on Computational Geometry, 1998, Montreal, Canada |
|
|
|
Improved incremental randomized Delaunay triangulationProceedings of the 14th Annual Symposium on Computational Geometry, 1998, Mineapolis, United States. pp.106-115, ⟨10.1145/276884.276896⟩ |
Checking the convexity of polytopes and the planarity of subdivisionsWorkshop Algorithms and Data Structures, 1997, Halifax, Canada. pp.186-199 |
|
Symbolic Elimination for parallel manipulatorsCommunication at 4th International Symposium on Effective Methods in Algebraic Geometry (MEGA)., 1996, Eindhoven, Netherlands |
|
Optimal Line Bipartitions of Point SetsInternational Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.45-54 |
|
Computing the Maximum Overlap of Two Convex Polygons Under TranslationsInternational Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135 |
|
Computing Largest Circles Separating Two Sets of Segments8th Canadian Conference on Computational Geometry, 1996, Ottawa, Canada |
|
|
|
Computational geometry and discrete computationsDiscrete Geometry for Computer Imagery, 1996, Lyon, France |
|
|
Evaluation of a new method to compute signs of determinantsProceedings of the 11th Annual Symposium on Computational Geometry, 1995, Vancouver, Canada. pp.C16-C17, ⟨10.1145/220279.220329⟩ |
Circular separability of polygonProceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281 |
|
|
|
A Locally Optimal Triangulation of the Hyperbolic ParaboloidCanadian Conference on Computational Geometry, Aug 1995, Quebec, Canada. pp.49-54 |
Motion planning of legged robotsWorkshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States |
|
An introduction to randomization in computational geometryWorkshop on Algorithmic Complexity of Algebraic and Geometric Models, 1994, ~, France |
|
|
|
From spider robots to half disk robotsIEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958 |
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points.Canadian Conference on Computational Geometry, 1994, Saskatoon, Canada. pp.122-127 |
|
|
|
Convex Tours of Bounded CurvatureProceedings of the 2nd European Symposium on Algorithms, 1994, Utrecht, Netherlands. pp.254-265, ⟨10.1007/BFb0049413⟩ |
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolasCanadian Conference on Computational Geometry, 1994, Saskatoon, Canada. pp.153-158 |
|
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related ProblemsProceedings of 1st European Symposium on Algorithms, 1993, Nad Honef, Germany. pp.133-144, ⟨10.1007/3-540-57273-2_50⟩ |
|
Computing the whole set of Connolly SurfacesAnnual Conference of the Molecular Graphics Society, 1993, ~, France |
|
Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputersWorkshop Algorithms and Data Structures, 1993, Montreal, Canada. pp.277-288 |
|
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension dCanadian Conference on Computational Geometry, 1992, St. John's, Canada |
|
|
|
Stable placements of spider robotsProceedings of the 8th Annual Symposium on Computational Geometry, 1992, Berlin, Germany. pp.242-250, ⟨10.1145/142675.142725⟩ |
Motion planning for a spider robotIEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326 |
|
The space of spheres, a geometric tool to unify duality results on Voronoi diagramsCanadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.263-268 |
|
Computing Connolly SurfacesIFIP Conference on Algorithms and efficient computation, 1992, ?, France |
|
|
|
Guarding Vertices versus Guarding Edges in a Simple Polygon4th Canadian Conference on Computational Geometry, 1992, St. John's, Canada. pp.99-102 |
On-line geometric algorithms with good expected behaviours3th World Congress on Computation and Applied Mathematics, 1991, ~, France. pp.137-139 |
|
Output-sensitive construction of the $3$-d Delaunay triangulation of constrained sets of pointsCanadian Conference on Computational Geometry, 1991, Burnaby, Canada. pp.110-113 |
|
Fully dynamic Delaunay triangulation in logarithmic expected time per operationWorkshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53 |
|
Computing the Union of 3-Colored TrianglesSystem Modelling and Optimization, IFIP, 1991, Zurich, Switzerland. pp.85-93 |
|
Simple randomized $O(n \log^{*} n)$ algorithmsCanadian Conference on Computational Geometry, 1991, Burnaby, Canada. pp.141-144 |
|
An on-line construction of higher-order Voronoi diagrams and its randomized analysisCanadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281 |
|
The Macro-Regions,an Efficient Space Subdivision Structure for Ray TracingEurographics, 1989, Hambourg, Germany. pp.27-38 |
|
Tools to Study the Efficiency of Space Subdivision Structures for Ray TracingPIXIM, 1989, Paris, France. pp.467-481 |
|
|
One-Bend Drawing of $K_n$ in 3D, revisitedMichael A. Bekos; Markus Chimani. The 31st International Symposium on Graph Drawing and Network Visualization, Sep 2023, Palermo, Italy. Springer, 2023 |
|
|
A generator of random convex polygons in a discAofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France |
|
|
A chaotic random convex hullAofA 2014- 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France |
|
|
The Maximum Degree of a Random Delaunay Triangulation in a Smooth ConvexAofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (2014), Jun 2014, Paris, France |
|
|
Tiling the hyperbolic planeBending Reality: Where art and science meet, 2013, Dagstuhl, Wadern, Germany |
|
|
Vertex Deletion for 3D Delaunay TriangulationsACM. Symposium on Theory of Computing, 2013, Palo Alto, United States. 2013 |
|
|
Crossing-free straight-line drawing of graphs on the flat torusWorkshop on Geometric Structures with Symmetry and Periodicity, 2014, Kyoto, Japan |
Discrete and Computational Geometry; Special Issue: 30th Annual Symposium on Computational Geometryspringer, 53 (3), 2015 |
|
Journal of Computational Geometry; Special issue of Selected Papers from SoCG 2014Computational Geometry Lab, Carleton University, 6 (2), 2015 |
|
Proceedings of the 30th Annual Symposium on Computational GeometrySiu Wing Cheng and Olivier Devillers. ACM, pp.571, 2014 |
|
|
Gedeon1999 |
|
|
SCARST: Schnyder Compact And Regularity Sensitive Triangulation Data Structure2023 |
|
|
Drawing $K_n$ in Three Dimensions with One Bend per Edge, revisited2023 |
|
|
Two Lower Bounds for Random Point Sets via Negative Association2023 |
|
|
On Order Types of Random Point Sets2020 |
|
|
Delaunay Triangulations of Points on Circles2018 |
|
|
Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cylinder and torus2017 |
|
|
Delaunay triangulation of a random sample of a good sample has linear size2017 |