Pages that link to "Item:Q427141"
From MaRDI portal
The following pages link to A faster circle-sweep Delaunay triangulation algorithm (Q427141):
Displaying 4 items.
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix (Q1195312) (← links)
- A functional language to implement the divide-and-conquer Delaunay triangulation algorithm (Q2572671) (← links)
- A triangulation algorithm based on edge-pointer search and region-division (Q4998040) (← links)