Pages that link to "Item:Q799379"

The following pages link to Delaunay triangulation and the convex hull of n points in expected linear time (Q799379):

Displaying 26 items.

• A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
• An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
• Automatic mesh generation for finite element analysis (Q753452) (← links)
• Higher-dimensional Voronoi diagrams in linear expected time (Q804320) (← links)
• Linear-time reconstruction of Delaunay triangulations with applications (Q826118) (← links)
• A straightforward iterative algorithm for the planar Voronoi diagram (Q910230) (← links)
• An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
• A note on the expected time required to construct the outer layer (Q1062448) (← links)
• Computing relative neighbourhood graphs in the plane (Q1082094) (← links)
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
• A linear expected-time algorithm for computing planar relative neighbourhood graphs (Q1108002) (← links)
• Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix (Q1195312) (← links)
• On the randomized construction of the Delaunay tree (Q1210297) (← 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)
• A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
• Fast Delaunay triangulation in three dimensions (Q2564605) (← links)
• Fast range searching with Delaunay triangulations (Q2783173) (← links)
• Delaunay triangulations in <i>O</i> (sort( <i>n</i> )) time and more (Q3016253) (← links)
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION (Q3212323) (← links)
• Delaunay triangulations of imprecise pointsin linear time after preprocessing (Q3602931) (← links)
• DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS (Q3765246) (← links)
• Computing the convex hull in the Euclidean plane in linear expected time (Q3974960) (← links)
• (Q4037406) (← links)
• Nice point sets can have nasty Delaunay triangulations (Q5361564) (← links)
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations (Q6551197) (← links)