An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations
From MaRDI portal
Publication:749241
DOI10.1007/BF01759042zbMath0712.68102MaRDI QIDQ749241
Gary M. Shute, Linda L. Deneen, Clark D. Thomborson
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Voronoi diagram; computational geometry; Delaunay triangulation; minimal spanning tree; \(L_ 1\)-metric; \(L_{\infty }\)- metric; plane-sweep algorithm
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items