 |
 |
 |
|
|
||
|---|---|---|
| hal-01586511v1
Journal articles
Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2017, 8 (1), pp.282--315. ⟨10.20382/jocg.v8i1a11⟩ |
||
| inria-00090638v1
Journal articles
The Number of Cylindrical Shells Discrete and Computational Geometry, Springer Verlag, 2003, 30 (3), pp.453-458. ⟨10.1007/s00454-003-2818-8⟩ |
||
| hal-01477030v1
Journal articles
Expected Length of the Voronoi Path in a High Dimensional Poisson-Delaunay Triangulation Discrete and Computational Geometry, Springer Verlag, 2018, 60 (1), pp.200--219. ⟨10.1007/s00454-017-9866-y⟩ |
||
| inria-00090653v1
Journal articles
A probabilistic analysis of the power of arithmetic filters Discrete and Computational Geometry, Springer Verlag, 1998, 20 (4), pp.523--547. ⟨10.1007/PL00009400⟩ |
||
| inria-00090675v1
Journal articles
Applications of random sampling to on-line algorithms in computational geometry Discrete and Computational Geometry, Springer Verlag, 1992, 8 (1), pp.51--71. ⟨10.1007/BF02293035⟩ |
||
| hal-01180166v1
Conference papers
An on-line construction of higher-order Voronoi diagrams and its randomized analysis Canadian Conference on Computational Geometry, 1990, Ottawa, Canada. pp.278-281 |
||
| inria-00001187v1
Conference papers
Dynamic updates of succinct triangulations 18th Canadian Conference on Computational Geometry, 2005, Windsor, Canada, France |
||
| inria-00098669v1
Conference papers
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⟩ |
||
| hal-00758686v1
Reports
The monotonicity of f-vectors of random polytopes [Research Report] RR-8154, INRIA. 2012, pp.10 |
||
| inria-00485915v2
Reports
Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time [Research Report] RR-7299, INRIA. 2010, pp.10 |
||
| hal-01384396v2
Journal articles
Recognizing Shrinkable Complexes Is NP-Complete Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2016, 7 (1), pp.430--443. ⟨10.20382/jocg.v7i1a18⟩ |
||
| |
||
| hal-01712628v1
Journal articles
Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path International Journal of Computational Geometry and Applications, World Scientific Publishing, 2018, 28 (3), pp.255-269. ⟨10.1142/S0218195918500061⟩ |
||
| hal-01015747v1
Conference papers
Recognizing shrinkable complexes is NP-complete Proceedings of the 22nd European Symposium on Algorithms, 2014, Wroclaw, Poland. pp.74-86, ⟨10.1007/978-3-662-44777-2_7⟩ |
||
| hal-01132440v1
Journal articles
Homological Reconstruction and Simplification in R3 Computational Geometry, Elsevier, 2015, 48 (8), pp.606-621. ⟨10.1016/j.comgeo.2014.08.010⟩ |
||
| hal-01179417v1
Conference papers
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-01168565v1
Book sections
Compact data structures for triangulations Encyclopedia of Algorithms, Springer, 2015, ⟨10.1007/978-3-642-27848-8_589-1⟩ |
||
| hal-00850588v1
Conference papers
Explicit array-based compact data structures for planar and surface meshes XIV Spanish Meeting on Computational Geometry,, 2011, Alcala de Henares, Spain |
||
| hal-01179898v1
Conference papers
Motion planning for a spider robot IEEE International Conference on Robotics and Automation, 1992, Nice, France. pp.2321-2326 |
||
| 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-01568030v1
Reports
Delaunay triangulation of a random sample of a good sample has linear size [Research Report] RR-9082, Inria Saclay Ile de France; Inria Nancy - Grand Est. 2017, pp.6 |
||
| 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-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 |
||
| hal-01168575v1
Book sections
Delaunay triangulation and randomized constructions Encyclopedia of Algorithms, Springer, 2014, ⟨10.1007/978-3-642-27848-8_711-1⟩ |
||
| hal-00678615v1
Conference papers
Explicit array-based compact data structures for triangulations 22nd International Symposium on Algorithms and Computation, 2011, Yokohama, Japan. pp.312--322 |
||
| inria-00412352v1
Conference papers
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-01179468v1
Conference papers
Circular separability of polygon Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, ~, United States. pp.273-281 |
||
| 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 |
||
| hal-01698928v1
Reports
3D Snap Rounding [Research Report] RR-9149, Inria Nancy - Grand Est. 2018, pp.1-22 |
||
|
|
||