 |
 |
 |
|
|
||
|---|---|---|
| hal-01214021v2
Reports
Smoothed complexity of convex hulls by witnesses and collectors [Research Report] 8787, INRIA. 2015, pp.41 |
||
| inria-00523812v2
Journal articles
2D Centroidal Voronoi Tessellations with Constraints Numerical mathematics : a journal of Chinese universities, Nanjing University Press, 2010, 3 (2), pp.212--222. ⟨10.4208/nmtma.2010.32s.6⟩ |
||
| hal-01216212v1
Reports
The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$ [Research Report] RR-8792, INRIA. 2015, pp.25 |
||
| hal-01285120v1
Journal articles
Smoothed complexity of convex hulls by witnesses and collectors Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (2), pp.101-144. ⟨10.20382/jocg.v7i2a6⟩ |
||
| inria-00413144v1
Conference papers
Isotropic Surface Remeshing International Conference on Shape Modeling and applications,, May 2003, Seoul, South Korea |
||
| inria-00413506v1
Journal articles
Dynamic location in an arrangement of line segments in the plane Algorithms Review - newsletter of the ESPRIT II Basic Research Action Project no. 3075 (ALCOM) , Utrecht University, 1992, 2 (3), pp.89-103 |
||
| hal-01348831v1
Journal articles
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. ⟨10.20382/jocg.v7i1a16⟩ |
||
| hal-01179730v1
Conference papers
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems Proceedings of 1st European Symposium on Algorithms, 1993, Nad Honef, Germany. pp.133-144, ⟨10.1007/3-540-57273-2_50⟩  |
||
| hal-01179450v1
Conference papers
Computing the Maximum Overlap of Two Convex Polygons Under Translations International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135 |
||
| inria-00413159v1
Journal articles
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d Computational Geometry, Elsevier, 1996, 6, pp.123-130. ⟨10.1016/0925-7721(95)00024-0⟩ |
||
| hal-01179442v1
Conference papers
Rounding Voronoi Diagram Discrete Geometry and Computational Imagery, 1999, Noisy le grand, France. pp.375-387 |
||
| hal-01180157v1
Conference papers
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-01179425v1
Conference papers
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⟩  |
||
| inria-00412646v1
Journal articles
Chromatic Variants of the Erdös-Szekeres Theorem on Points in Convex Position Computational Geometry, Elsevier, 2003, 26, pp.193-208. ⟨10.1016/S0925-7721(03)00013-0⟩ |
||
| hal-01180161v1
Conference papers
On-line geometric algorithms with good expected behaviours 3th World Congress on Computation and Applied Mathematics, 1991, ~, France. pp.137-139 |
||
| inria-00166709v1
Journal articles
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⟩ |
||
| hal-01117289v1
Conference papers
Transmission progressive de modèles triangulés sur le réseau CORESA, Jan 2003, Lyon, France |
||
| inria-00413181v1
Journal articles
Convex Tours of Bounded Curvature. Computational Geometry, Elsevier, 1999, 13, pp.149-160. ⟨10.1016/S0925-7721(99)00022-X⟩ |
||
| inria-00097857v1
Journal articles
Un joli algorithme géométrique et ses vilains problèmes numériques Interstices, INRIA, 2006, pp.~ |
||
| inria-00413229v1
Conference papers
A Locally Optimal Triangulation of the Hyperbolic Paraboloid Canadian Conference on Computational Geometry, Aug 1995, Quebec, Canada. pp.49-54 |
||
| hal-00795083v1
Journal articles
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-01179408v1
Conference papers
Triangulations in CGAL Proceedings of the 16th Annual Symposium on Computational Geometry, 2000, Hong Kong, China. pp.11-18, ⟨10.1145/336154.336165⟩ |
||
| inria-00343651v1
Reports
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem [Research Report] RR-6748, INRIA. 2008 |
||
| hal-01179475v1
Conference papers
Convex Tours of Bounded Curvature Proceedings of the 2nd European Symposium on Algorithms, 1994, Utrecht, Netherlands. pp.254-265, ⟨10.1007/BFb0049413⟩ |
||
| hal-01179456v1
Conference papers
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⟩ |
||
| inria-00090707v1
Conference papers
Succinct representation of triangulations with a boundary 9th Workshop on Algorithms and Data Structures, Aug 2005, Waterloo, Canada, pp.134--135 |
||
| inria-00090667v1
Journal articles
Circular Separability of Polygons Algorithmica, Springer Verlag, 2001, 30 (1), pp.67--82. ⟨10.1007/s004530010078⟩ |
||
| hal-01179691v1
Conference papers
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
Fully dynamic Delaunay triangulation in logarithmic expected time per operation Workshop Algorithms and Data Structures, 1991, Ottawa, Canada. pp.42-53 |
||
| hal-01179453v1
Conference papers
Optimal Line Bipartitions of Point Sets International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.45-54 |
||
|
|
||
