Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing

DOI10.1016/j.comgeo.2012.03.004zbMath1262.65031OpenAlexW1589450195MaRDI QIDQ1940703

Wolfgang Mulzer, Esther Ezra

Publication date: 7 March 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.03.004

zbMATH Keywords

algorithmconvex hullgeometric data structuredata imprecisionplanar arrangements

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

Minimizing the diameter of a spanning tree for imprecise points ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Complexity analysis and performance of double hashing sort algorithm

This page was built for publication: Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing