scientific article; zbMATH DE number 934894
From MaRDI portal
Publication:4895370
zbMATH Open0858.68115MaRDI QIDQ4895370FDOQ4895370
Authors: Lucian Cucu, Mircea Drăgan, Tudor Jebelean, Viorel Negru 
Publication date: 25 March 1997
Title of this publication is not available (Why is that?)
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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Cited In (7)
- Title not available (Why is that?)
- On sorting triangles in a Delaunay tessellation
- Parallel \(d\)-D Delaunay triangulations in shared and distributed memory
- Localizing the Delaunay triangulation and its parallel implementation
- Splitting a Delaunay triangulation in linear time
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
- 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)
