|
||
---|---|---|
hal-00784900v1
Journal articles
A tight bound for the Delaunay triangulation of points on a polyhedron Discrete and Computational Geometry, Springer Verlag, 2012, 48 (1), pp.19-38. ⟨10.1007/s00454-012-9415-7⟩ |
||
inria-00098300v2
Reports
Complexity of Delaunay triangulation for points on lower-dimensional~polyhedra [Research Report] RR-5986, INRIA. 2006, pp.12 |
||
hal-01300281v1
Journal articles
3D Skeletons: A State-of-the-Art Report Computer Graphics Forum, Wiley, 2016, 35 (2), pp.573-597. ⟨10.1111/cgf.12865⟩ |
||
inria-00277899v2
Reports
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron [Research Report] RR-6522, -; INRIA. 2008 |
||
inria-00182835v2
Conference papers
Complexity of Delaunay Triangulation for Points on Lower-dimensional~Polyhedra Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, Jan 2007, New Orleans, United States. pp.1106--1113 |
||
|