Pages that link to "Item:Q664607"
From MaRDI portal
The following pages link to A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607):
Displaying 6 items.
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix (Q1195312) (← links)
- Parallel computation of alpha complexes for biomolecules (Q2206738) (← links)
- (Q3391377) (← links)
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES (Q3430330) (← links)
- \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations (Q6551197) (← links)