A counterexample to a dynamic algorithm for convex hulls of line arrangements
References (9)
Computing the convex hull of line intersections
J. Algorithms
(1986)An incremental computation of convex hull of planar line intersections
Pattern Recognition Letters
(1990)- et al.
Finding the diameter of a set of lines
Pattern Recognition
(1985) A historical note on convex hull finding algorithms
Pattern Recognition Letters
(1985)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1991 Published by Elsevier B.V.