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 13 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)
• 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)
• 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)
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
• A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
• Fast Delaunay triangulation in three dimensions (Q2564605) (← links)
• DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS (Q3765246) (← links)