On sorting triangles in a Delaunay tessellation

DOI10.1007/BF01759057zbMATH Open0726.68075MaRDI QIDQ802898FDOQ802898

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

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

Recommendations

• Delaunay triangulations in O (sort( n )) time and more
• On the number of higher order Delaunay triangulations
• On the Number of Higher Order Delaunay Triangulations
• Higher order Delaunay triangulations
• Publication:2753939
• Optimal higher order Delaunay triangulations of polygons
• Optimal Higher Order Delaunay Triangulations of Polygons
• Computing correct Delaunay triangulations
• scientific article; zbMATH DE number 934894

zbMATH Keywords

Delaunay triangulationsortingvisibility

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• One machine, one minute, three billion tetrahedra
• Delaunay triangulations in O (sort( n )) time and more
• Remarks on the computation of the horizon of a digital terrain
• Toughness and Delaunay triangulations
• WALKING IN A TRIANGULATION
• An acyclicity theorem for cell complexes in d dimensions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802898)