A parallel algorithm based on convexity for the computing of Delaunay tessellation
From MaRDI portal
Publication:664607
DOI10.1007/s11075-011-9493-2zbMath1236.65016WikidataQ57659439 ScholiaQ57659439MaRDI QIDQ664607
Publication date: 2 March 2012
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-011-9493-2
algorithm; convexity; convex hull; Delaunay tessellation; parallel method; geometric computing; divide-conquer strategy
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
65Y05: Parallel numerical computation
Related Items
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\), Unnamed Item
Cites Work
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Voronoi diagrams and arrangements
- Design and implementation of a practical parallel Delaunay algorithm
- Voronoi diagrams from convex hulls
- An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program
- Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item