Implicit Convex Polygons

Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation has been considered in several fields such as facility location, robotics and computer graphics. In this paper, we investigate many fundamental geometric problems for implicitly represented polygons and give simple and fast algorithms that are easy to implement. We uncover an interesting partition of the problems into two classes: those that exhibit an Ω(nlog n) lower bound on their complexity, and those that yield O(n) time algorithms via prune-and-search methods.

[1]  Godfried T. Toussaint,et al.  A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets , 1982, Pattern Recognit. Lett..

[2]  F. Hurtado,et al.  Some Constrained Minimax and Maximin Location Problems , 2000 .

[3]  C. A. R. Hoare.  Algorithm 63: partition , 1961, CACM.

[4]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[5]  Godfried T. Toussaint,et al.  Computing the Width of a Set , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Godfried T. Toussaint,et al.  Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets , 1983, J. Algorithms.

[7]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[8]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[9]  Martin E. Dyer,et al.  On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..

[10]  Brian A. Barsky,et al.  A New Concept and Method for Line Clipping , 1984, TOGS.

[11]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[12]  S. W. Dharmadhikari,et al.  A characterization of convexity and central symmetry for planar polygonal sets , 1973 .

[13]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[14]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[15]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[16]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[17]  Gabriel M. Kuper,et al.  Linear Constraints: Geometric Objects Represented by Inequalities , 1997, COSIT.

[18]  Godfried Toussaint.  - 1-Solving Geometric Problems with the Rotating Calipers * , 1983 .

[19]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

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

[21]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[22]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..