A counterexample to a dynamic algorithm for convex hulls of line arrangements

Abstract An algorithm was recently published to maintain dynamically the convex hull of the set I of intersection points of a set L of n lines in the plane (Boreddy 1990). In other words, given the convex hull of I it is desired to update the convex hull when a new line is added to L (the insertion problem) and it is desired to update the convex hull when an old line is deleted from L (the deletion problem). No proofs of correctness are given in (Boreddy 1990). In fact, we show in this note that the deletion algorithm proposed is incorrect.

[1]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[2]  Jayaramaiah Boreddy.  An incremental computation of convex hull of planar line intersections , 1990, Pattern Recognit. Lett..

[3]  Godfried T. Toussaint,et al.  A historical note on convex hull finding algorithms , 1985, Pattern Recognit. Lett..

[4]  Mikhail J. Atallah.  Computing the Convex Hull of Line Intersections , 1986, J. Algorithms.

[5]  Godfried T. Toussaint,et al.  Convex Hulls for Random Lines , 1993, J. Algorithms.

[6]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[7]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[8]  D. T. Lee,et al.  Finding the diameter of a set of lines , 1985, Pattern Recognit..

[9]  Leonidas J. Guibas,et al.  The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..