Pages that link to "Item:Q1094872"

The following pages link to A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872):

Displaying 24 items.

• A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
• Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints (Q727384) (← links)
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
• An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
• Minimal roughness property of the Delaunay triangulation (Q751165) (← links)
• Delaunay triangulation and the convex hull of n points in expected linear time (Q799379) (← links)
• Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
• HCPO: an efficient insertion order for incremental Delaunay triangulation (Q834986) (← links)
• A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (Q1401886) (← links)
• Triangulations in CGAL (Q1602941) (← links)
• Delaunay refinement algorithms for triangular mesh generation (Q1602942) (← links)
• LOOK: A lazy object-oriented kernel design for geometric computation (Q1602944) (← links)
• The maximum opposite angulation for mesh construction (Q1774289) (← links)
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
• Splitting a Delaunay triangulation in linear time (Q1849762) (← links)
• Reprint of: Delaunay refinement algorithms for triangular mesh generation (Q2249046) (← links)
• SAR imaging simulation for an inhomogeneous undulated lunar surface based on triangulated irregular network (Q2267086) (← links)
• A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
• An algorithm for dynamic Delaunay triangulation of simple polygon (Q2887614) (← links)
• Delaunay triangulations in <i>O</i> (sort( <i>n</i> )) time and more (Q3016253) (← links)
• (Q4037406) (← links)
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations (Q6551197) (← links)
• \textsc{TriMe++}: multi-threaded triangular meshing in two dimensions (Q6671939) (← links)