On sorting triangles in a Delaunay tessellation

DOI10.1007/BF01759057zbMath0726.68075MaRDI QIDQ802898

Caterina Pienovi, Leila De Floriani, George Nagy, Bianca Falcidieno

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

sortingvisibilityDelaunay triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (5)

Remarks on the computation of the horizon of a digital terrain ⋮ WALKING IN A TRIANGULATION ⋮ One machine, one minute, three billion tetrahedra ⋮ An acyclicity theorem for cell complexes in d dimensions ⋮ Toughness and Delaunay triangulations

This page was built for publication: On sorting triangles in a Delaunay tessellation