scientific article; zbMATH DE number 2088191

zbMATH Open1049.68717MaRDI QIDQ4739335FDOQ4739335

Authors: Ivana Kolingerová 

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2331/23310125.htm

Title of this publication is not available (Why is that?)

Recommendations

• THE DELAUNAY HIERARCHY
• Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
• A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems
• DELAUNAY TRIANGULATIONS IN THE PLANE WITH ${\mathcal O} (\sqrt{N} \log N)$ STORAGE REQUIREMENTS
• Fast Delaunay triangulation in three dimensions

Mathematics Subject Classification ID

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

Uses Software

• DeWall

This page was built for publication:

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