Skip to Main content Skip to Navigation


...
inria-00412352v1  Conference papers
Oswin AichholzerFranz AurenhammerOlivier DevillersThomas HacklMonique Teillaud et al.  Lower and upper bounds on the number of empty cylinders and ellipsoids
European Workshop on Computational Geometry, Mar 2009, Bruxelles, Belgium. pp.139-142
hal-01179696v1  Conference papers
Pierre AlliezOlivier DevillersJack Snoeyink. Removing Degeneracies by Perturbing the Problem or the World
Canadian Conference on Computational Geometry, 1998, Montreal, Canada
...
inria-00413144v1  Conference papers
Pierre AlliezÉric Colin de VerdièreOlivier DevillersMartin Isenburg. Isotropic Surface Remeshing
International Conference on Shape Modeling and applications,, May 2003, Seoul, South Korea
...
inria-00182835v2  Conference papers
Nina AmentaDominique AttaliOlivier Devillers. Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra
Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, Jan 2007, New Orleans, United States. pp.1106--1113
...
hal-00833791v1  Conference papers
Dominique AttaliUlrich BauerOlivier DevillersMarc GlisseAndré Lieutier. Homological Reconstruction and Simplification in R3
SoCG 2013 - 29th Annual Symposium on Computational Geometry, Jun 2013, Rio de Janeiro, Brazil. pp.117-125, ⟨10.1145/2462356.2462373⟩
...
hal-01015747v1  Conference papers
Dominique AttaliOlivier DevillersMarc GlisseSylvain Lazard. Recognizing shrinkable complexes is NP-complete
ESA 2014 - 22nd Annual European Symposium on Algorithms, Sep 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩
hal-01179456v1  Conference papers
Francis AvnaimJean-Daniel BoissonnatOlivier DevillersFranco P. PreparataMariette yvinec. Evaluation of a new method to compute signs of determinants
Proceedings of the 11th Annual Symposium on Computational Geometry, 1995, Vancouver, Canada. pp.C16-C17, ⟨10.1145/220279.220329⟩
hal-01179450v1  Conference papers
Mark De BergOlivier DevillersMarc Van KreveldOtfried SchwarzkopfMonique Teillaud. Computing the Maximum Overlap of Two Convex Polygons Under Translations
International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135
...
hal-00833760v1  Conference papers
Mikhail BogdanovOlivier DevillersMonique Teillaud. Hyperbolic Delaunay Complexes and Voronoi Diagrams Made Practical
Proceedings of the 29th Annual Symposium on Computational Geometry, Jun 2013, Rio, Brazil. pp.67-76, ⟨10.1145/2462356.2462365⟩
...
hal-00850586v1  Conference papers
Mikhail BogdanovOlivier DevillersMonique Teillaud. Hyperbolic Delaunay triangulations and Voronoi diagrams made practical
XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain
hal-01180161v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersRené SchottMonique TeillaudMariette yvinec. On-line geometric algorithms with good expected behaviours
3th World Congress on Computation and Applied Mathematics, 1991, ~, France. pp.137-139
hal-01179461v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersSylvain Lazard. Motion planning of legged robots
Workshop on Algorithmic foundations of robotics, 1994, San Francisco?, United States
hal-01179904v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersLeonbattista DonatiFranco P. Preparata. Stable placements of spider robots
Proceedings of the 8th Annual Symposium on Computational Geometry, 1992, Berlin, Germany. pp.242-250, ⟨10.1145/142675.142725⟩
hal-01179713v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersJacqueline DuquesneMariette yvinec. Computing the whole set of Connolly Surfaces
Annual Conference of the Molecular Graphics Society, 1993, ~, France
hal-01179468v1  Conference papers
Jean-Daniel BoissonnatJurek CzyzowiczOlivier DevillersMariette yvinec. Circular separability of polygon
Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281
...
inria-00442776v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersSylvain Lazard. From spider robots to half disk robots
IEEE International Conference on Robotics and Automation, 1994, San Diego, United States. pp.953-958
...
inria-00412437v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersSamuel Hornus. Incremental construction of the Delaunay graph in medium dimension
Proceedings of the 25th Annual Symposium on Computational Geometry, Jun 2009, Aarhus, Denmark. pp.208-216, ⟨10.1145/1542362.1542403⟩
hal-01180152v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersJacqueline Duquesne. Computing Connolly Surfaces
IFIP Conference on Algorithms and efficient computation, 1992, ?, France
hal-01180166v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersMonique Teillaud. An on-line construction of higher-order Voronoi diagrams and its randomized analysis
Canadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281
hal-01179475v1  Conference papers
Jean-Daniel BoissonnatJurek CzyzowiczOlivier DevillersJean-Marc RobertMariette yvinec. Convex Tours of Bounded Curvature
Proceedings of the 2nd European Symposium on Algorithms, 1994, Utrecht, Netherlands. pp.254-265, ⟨10.1007/BFb0049413⟩
hal-01179145v1  Conference papers
Jean-Daniel BoissonnatJurek CzyzowiczOlivier DevillersJorge UrrutiaMariette yvinec. Computing Largest Circles Separating Two Sets of Segments
8th Canadian Conference on Computational Geometry, 1996, Ottawa, Canada
hal-01179898v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersLeonbattista DonatiFranco P. Preparata. Motion planning for a spider robot
IEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326
hal-01180155v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersFranco P. Preparata. Computing the Union of 3-Colored Triangles
System Modelling and Optimization, IFIP, 1991, Zurich, Switzerland. pp.85-93
...
inria-00348713v1  Conference papers
Jean-Daniel BoissonnatFrédéric CazalsTran Kai Frank DaOlivier DevillersSylvain 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
...
hal-02479502v1  Conference papers
Prosenjit BoseJean-Lou de CarufelOlivier Devillers. Expected Complexity of Routing in $\Theta_6$ and Half-$\Theta_6$ Graphs
EuroCG 2020 - 36th European Workshop on Computational Geometry, Mar 2020, Würzburg, Germany
...
hal-01366148v1  Conference papers
David BremnerOlivier DevillersMarc GlisseSylvain LazardGiuseppe Liotta et al.  Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$
24th International Symposium on Graph Drawing & Network Visualization, Sep 2016, Athens, Greece
...
inria-00103995v1  Conference papers
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D
Proceedings of the 20th Annual Symposium on Computational Geometry, Jun 2004, Brooklyn, NY, United States. pp.46 - 55, ⟨10.1145/997817.997827⟩
...
inria-00099449v1  Conference papers
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  On the Number of Lines Tangent to Four Convex Polyhedra
14th Canadian Conference on Computational Geometry - CCCG'02, 2002, Lethbridge, Canada
...
inria-00099873v1  Conference papers
Hervé BrönnimannOlivier DevillersSylvain LazardFrank 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
...
hal-01018174v1  Conference papers
Nicolas BroutinOlivier DevillersRoss 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
...
hal-02186693v1  Conference papers
Kevin BuchinPedro M. M. de CastroOlivier DevillersMenelaos Karavelas. Hardness results on Voronoi, Laguerre and Apollonius diagrams
CCCG 2019 - Canadian Conference on Computational Geometry, Aug 2019, Edmonton, Canada
...
hal-00832992v1  Conference papers
Kevin BuchinOlivier DevillersWolfgang MulzerOkke SchrijversJonathan Shewchuk. Vertex Deletion for 3D Delaunay Triangulations
Proceedings of the 21st European Symposium on Algorithms, 2013, Sophia Antipolis, France. pp.253-264, ⟨10.1007/978-3-642-40450-4_22⟩
...
inria-00090707v1  Conference papers
Luca Castelli AleardiOlivier DevillersGilles Schaeffer. Succinct representation of triangulations with a boundary
9th Workshop on Algorithms and Data Structures, Aug 2005, Waterloo, Canada, pp.134--135
...
hal-00793636v1  Conference papers
Luca Castelli AleardiOlivier DevillersEric 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. pp.376-387, ⟨10.1007/978-3-642-36763-2_34⟩
...
hal-00793592v1  Conference papers
Luca Castelli AleardiOlivier DevillersJarek Rossignac. ESQ: Editable SQuad Representation for Triangle Meshes
25th SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2012, Aug 2012, Ouro Preto, Brazil. pp.110-117, ⟨10.1109/SIBGRAPI.2012.24⟩
hal-00850588v1  Conference papers
Luca Castelli AleardiOlivier Devillers. Explicit array-based compact data structures for planar and surface meshes
XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain
...
inria-00098669v1  Conference papers
Luca Castelli AleardiOlivier DevillersGilles Schaeffer. Optimal Succinct Representations of Planar Maps
Proceedings of the 22nd Annual Symposium on Computational Geometry, Jun 2006, Sedona, Arizona, United States. ⟨10.1145/1137856.1137902⟩
...
inria-00001187v1  Conference papers
Luca Castelli AleardiOlivier DevillersGilles Schaeffer. Dynamic updates of succinct triangulations
18th Canadian Conference on Computational Geometry, 2005, Windsor, Canada, France
...
hal-00678615v1  Conference papers
Luca Castelli AleardiOlivier Devillers. Explicit array-based compact data structures for triangulations
22nd International Symposium on Algorithms and Computation, 2011, Yokohama, Japan. pp.312--322
hal-01179401v1  Conference papers
Bernard ChazelleOlivier DevillersFerran HurtadoMercè MoraVera Sacristán et al.  Splitting a Delaunay Triangulation in Linear Time
Proceedings of the 8th European Symposium on Algorithms, 2001, Aarhus, Denmark. pp.312-320, ⟨10.1007/3-540-44676-1_26⟩
...
inria-00523684v1  Conference papers
Dan ChenOlivier DevillersJohn IaconoStefan LangermanPat Morin. Oja Medians and Centers of Gravity
22th Canadian Conference on Computational Geometry, Aug 2010, Winnipeg, Canada
...
inria-00187253v1  Conference papers
Julien DemouthOlivier DevillersHazel EverettMarc GlisseSylvain Lazard et al.  Between umbra and penumbra
Proceedings of the 23rd Annual Symposium on Computational Geometry, Hee-Kap Ahn, Otfried Cheong, and Kyung-Yong Chwa, Jun 2007, Gyeongju, South Korea. pp.265-274, ⟨10.1145/1247069.1247117⟩
...
inria-00331435v1  Conference papers
Julien DemouthOlivier DevillersMarc GlisseXavier Goaoc. Helly-type theorems for approximate covering
SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.120--128
...
inria-00413229v1  Conference papers
Pascal DesnoguesOlivier Devillers. A Locally Optimal Triangulation of the Hyperbolic Paraboloid
Canadian Conference on Computational Geometry, Aug 1995, Quebec, Canada. pp.49-54
...
inria-00412600v1  Conference papers
Olivier DevillersFranco P. Preparata. Evaluating the cylindricity of a nominally cylindrical point set
Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, Jan 2000, San Francisco, United States
...
inria-00166710v2  Conference papers
Olivier DevillersMonique Teillaud. Perturbations and Vertex Removal in a 3D Delaunay Triangulation
Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, 2003, Baltimore, MA, United States. pp.313--319