 |
 |
 |
|
|
||
|---|---|---|
| inria-00277899v2
Reports
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron [Research Report] RR-6522, -; INRIA. 2008 |
||
| inria-00343651v1
Reports
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem [Research Report] RR-6748, INRIA. 2008 |
||
| inria-00344053v1
Reports
Delaunay Triangulations for Moving Points [Research Report] RR-6750, INRIA. 2008 |
||
| inria-00176204v1
Conference papers
Empty-ellipse graphs 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'08), 2008, San Francisco, United States. pp.1249--1256 |
||
| |
||
| inria-00331435v1
Conference papers
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-00336256v1
Conference papers
Predicates for line transversals to lines and line segments in three-dimensional space SoCG 2008 - 24th Annual Symposium on Computational Geometry, Jun 2008, College Park, Maryland, United States. pp.174-181, ⟨10.1145/1377676.1377704⟩ |
||
| inria-00325816v1
Reports
State of the Art: Updating Delaunay Triangulations for Moving Points [Research Report] RR-6665, INRIA. 2008, pp.12 |
||
| inria-00337821v1
Journal articles
Succinct representations of planar maps Theoretical Computer Science, Elsevier, 2008, Excursions in Algorithmics: A Collection of Papers in Honor of Franco P. Preparata, 408 (2-3), pp.174-187. ⟨10.1016/j.tcs.2008.08.016⟩ |
||
|
|
||
