An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4172437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations |
scientific article; zbMATH DE number 4172437 |
Statements
An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (English)
0 references
1991
0 references
computational geometry
0 references
minimal spanning tree
0 references
Voronoi diagram
0 references
Delaunay triangulation
0 references
plane-sweep algorithm
0 references
\(L_ 1\)-metric
0 references
\(L_{\infty }\)- metric
0 references
0.832674503326416
0 references
0.8193092346191406
0 references
0.8058419823646545
0 references
0.7964637279510498
0 references
0.7913192510604858
0 references
