On a Class of O(n2) Problems in Computational Geometry

There are many problems in computational geometry for which the best know algorithms take time @Q(n^2) (or more) in the worst case while only very low lower bounds are known. In this paper we describe a large class of problems for which we prove that they are all at least as difficult as the following base problem 3sum: Given a set S of n integers, are there three elements of S that sum up to 0. We call such problems 3sum-hard. The best known algorithm for the base problem takes @Q(n^2) time. The class of 3sum-hard problems includes problems like: Given a set of lines in the plane, are there three that meet in a point?; or: Given a set of triangles in the plane, does their union have a hole? Also certain visibility and motion planning problems are shown to be in the class. Although this does not prove a lower bound for these problems, there is no hope of obtaining o(n^2) solutions for them unless we can improve the solution for the base problem.

[1]  G. Swaminathan.  Robot Motion Planning , 2006 .

[2]  Michael McKenna.  Worst-case optimal hidden-surface removal , 1987, TOGS.

[3]  Leonidas J. Guibas,et al.  The exact fitting problem for points , 1991 .

[4]  Micha Sharir,et al.  On the Union of Fat Wedges and Separating a Collection of Segments By a Line , 1993, Comput. Geom..

[5]  Bernard Chazelle,et al.  Better lower bounds on detecting affine and spherical degeneracies , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[6]  Ren-Hong Wang,et al.  On computational geometry , 2003 .

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

[8]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[9]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[11]  Herbert Edelsbrunner.  The computational Geometry Column , 1987, Bull. EATCS.

[12]  Stephen A. Bloch,et al.  How hard are n2-hard problems? , 1994, SIGA.

[13]  Mark de Berg.  Generalized Hidden Surface Removal , 1995, Comput. Geom..

[14]  Gert Vegter,et al.  The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning , 1990, Scandinavian Workshop on Algorithm Theory.

[15]  Joseph S. B. Mitchell,et al.  On the Complexity of Shattering Using Arrangements , 1991 .

[16]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[17]  Mark de Berg,et al.  Perfect Binary Space Partitions , 1993, Comput. Geom..

[18]  Mark H. Overmars,et al.  Efficient algorithms for exact motion planning amidst fat obstacles , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[19]  Mark H. Overmars,et al.  The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles , 1992, Comput. Geom..

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

[21]  Micha Sharir,et al.  Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..

[22]  Prosenjit Bose,et al.  Filling Polyhedral Molds , 1993, WADS.