scientific article; zbMATH DE number 934894

MaRDI QIDQ4895370zbMATHFDO

Authors Lucian Cucu, Mircea Drăgan, Tudor Jebelean, Viorel Negru

Publication date 25 March 1997

zbMATH Keywords

Delaunay triangulationVoronoi diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Localizing the Delaunay triangulation and its parallel implementation
• scientific article; zbMATH DE number 1822225
• Parallel \(d\)-D Delaunay triangulations in shared and distributed memory
• On parallel computation of Voronoi diagrams
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations

Cited in

(7)

• Splitting a Delaunay triangulation in linear time
• Localizing the Delaunay triangulation and its parallel implementation
• scientific article; zbMATH DE number 1822225 (Why is no real title available?)
• A parallel algorithm based on convexity for the computing of Delaunay tessellation
• On sorting triangles in a Delaunay tessellation
• Parallel \(d\)-D Delaunay triangulations in shared and distributed memory
• A new parallel algorithm for constructing Voronoi tessellations from distributed input data

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