<https://hal.archives-ouvertes.fr/inria-00072135#id>	<http://purl.org/dc/elements/1.1/date>	"2002" .
<https://hal.archives-ouvertes.fr/inria-00072135#id>	<http://id.loc.gov/vocabulary/relators/aut>	<http://www.idref.fr/029005655/id> .
<https://hal.archives-ouvertes.fr/inria-00072135#id>	<http://purl.org/dc/terms/title>	"A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces" .
<https://hal.archives-ouvertes.fr/inria-00072135#id>	<http://id.loc.gov/vocabulary/relators/aut>	<http://www.idref.fr/156931559/id> .
<https://hal.archives-ouvertes.fr/inria-00072135#id>	<http://purl.org/dc/terms/bibliographicCitation>	"Attali Dominique, Boissonnat Jean-Daniel. A Linear Bound on the Complexity of the Delaunay triangulation of points on polyhedral surfaces. [Research Report] RR-4453, INRIA. 2002" .