A parallel algorithm based on convexity for the computing of Delaunay tessellation

DOI10.1007/S11075-011-9493-2zbMATH Open1236.65016OpenAlexW2075058630WikidataQ57659439 ScholiaQ57659439MaRDI QIDQ664607FDOQ664607

Authors: Le Hong Trang, Phan Thanh An 

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

Recommendations

• Parallel \(d\)-D Delaunay triangulations in shared and distributed memory
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• scientific article; zbMATH DE number 934894
• Parallel implementation of 3D convex-hull algorithm
• Algorithm 872

zbMATH Keywords

algorithmconvex hullconvexityDelaunay tessellationparallel methodgeometric computingdivide-conquer strategy

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Voronoi diagrams and arrangements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Voronoi diagrams from convex hulls
• Title not available (Why is that?)
• Title not available (Why is that?)
• Design and implementation of a practical parallel Delaunay algorithm
• An optimal algorithm for constructing the weighted Voronoi diagram in the plane
• A modification of Graham's algorithm for determining the convex hull of a finite planar set
• 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
• An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves

Cited In (7)

• An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
• Title not available (Why is that?)
• Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
• Parallel computation of alpha complexes for biomolecules
• Parallel \(d\)-D Delaunay triangulations in shared and distributed memory
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations
• PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES

This page was built for publication: A parallel algorithm based on convexity for the computing of Delaunay tessellation

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