Pages that link to "Item:Q1195312"

The following pages link to Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix (Q1195312):

Displaying 9 items.

• A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
• \(C^{1}\) positive scattered data interpolation (Q980372) (← links)
• A simple unstructured tetrahedral mesh generation algorithm for complex geometries (Q1362260) (← links)
• \(C^{1}\) positivity preserving scattered data interpolation using rational Bernstein-Bézier triangular patch (Q2430475) (← links)
• A functional language to implement the divide-and-conquer Delaunay triangulation algorithm (Q2572671) (← links)
• Rapid prototyping through scanned point data (Q4674428) (← links)
• A triangulation algorithm based on edge-pointer search and region-division (Q4998040) (← links)
• Algorithm 1012 (Q5066585) (← links)
• Star splaying (Q5370618) (← links)