 |
 |
 |
|
|
||
|---|---|---|
| inria-00344053v1
Reports
Delaunay Triangulations for Moving Points [Research Report] RR-6750, INRIA. 2008 |
||
| inria-00325816v1
Reports
State of the Art: Updating Delaunay Triangulations for Moving Points [Research Report] RR-6665, INRIA. 2008, pp.12 |
||
| inria-00343651v1
Reports
Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem [Research Report] RR-6748, INRIA. 2008 |
||
| inria-00277899v2
Reports
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron [Research Report] RR-6522, -; INRIA. 2008 |
||
| inria-00493046v1
Reports
Walking Faster in a Triangulation [Research Report] RR-7322, Inria. 2010, pp.15 |
||
| inria-00448335v1
Reports
On the Size of Some Trees Embedded in Rd [Research Report] RR-7179, INRIA. 2010 |
||
| inria-00485915v2
Reports
Delaunay Triangulation of Imprecise Points, Preprocess and Actually Get a Fast Query Time [Research Report] RR-7299, INRIA. 2010, pp.10 |
||
| |
||
|
|
||
