scientific article; zbMATH DE number 1786514

zbMATH Open0990.68166MaRDI QIDQ4547809FDOQ4547809

Authors: Pierre Kauffmann, Jean-Claude Spehner 

Publication date: 21 August 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2098/20980205

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

Recommendations

• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• A fast algorithm for constructing Delaunay triangulations in the plane
• An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
• Construction of Voronoi diagrams in the plane by using maps
• An optimal algorithm for realizing a Delaunay triangulation

Mathematics Subject Classification ID

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

Cited In (1)

• Partial reduction and Delaunay/Deprit variables

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 Q4547809)