Skip to Main content Skip to Navigation

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-01179417v1  Conference papers
Olivier DevillersAlexandra FronvilleBernard MourrainMonique Teillaud. Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Proceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.139-147, ⟨10.1145/336154.336194⟩
hal-01179898v1  Conference papers
Jean-Daniel BoissonnatOlivier DevillersLeonbattista DonatiFranco Preparata. Motion planning for a spider robot
IEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326
hal-01179691v1  Conference papers
Olivier DevillersGiuseppe LiottaFranco PreparataRoberto Tamassia. Checking the convexity of polytopes and the planarity of subdivisions
Workshop Algorithms and Data Structures, 1997, Halifax, Canada. pp.186-199
hal-01180164v1  Conference papers
Olivier DevillersStefan MeiserMonique Teillaud. Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Workshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53
hal-01180157v1  Conference papers
Olivier DevillersStefan MeiserMonique 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
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-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
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-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-01179699v1  Conference papers
Olivier Devillers. An introduction to randomization in computational geometry
Workshop on Algorithmic Complexity of Algebraic and Geometric Models, 1994, ~, France
hal-01179435v1  Conference papers
Olivier Devillers. On deletion in Delaunay triangulations
Proceedings of the 15th Annual Symposium on Computational Geometry, 1999, Miami, United States. pp.181-189, ⟨10.1145/304893.304969⟩
hal-01179425v1  Conference papers
Olivier DevillersPierre-Marie Gandoin. Geometric compression for interactive transmission
Proceedings of the conference on Visualization '00, 2000, Salt Lake City, United States. pp.319-326, ⟨10.1109/VISUAL.2000.885711⟩
hal-01179721v1  Conference papers
Olivier DevillersAndreas Fabri. Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers
Workshop Algorithms and Data Structures, 1993, Montreal, Canada. pp.277-288
inria-00442806v1  Conference papers
Jean-Daniel BoissonnatSylvain Lazard. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
Symposium on Computational Geometry (SoCG'96), 1996, Philadelphia, United States. pp.242-251, ⟨10.1145/237218.237393⟩
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-00442802v1  Conference papers
Jean-Daniel BoissonnatSylvain Lazard. Convex hulls of bounded curvature
Canadian Conference on Computational Geometry (CCCG'96), 1996, Ottawa, Canada. pp.14-19
tel-00832414v1  Theses
Frank Nielsen. Algorithmes géométriques adaptatifs
Géométrie algorithmique [cs.CG]. Université Nice Sophia Antipolis, 1996. Français
tel-00832312v1  Theses
Monique Teillaud. Vers des algorithmes dynamiques randomisés en géométrie algorithmique
Géométrie algorithmique [cs.CG]. Université Paris Sud - Paris XI, 1991. Français