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.
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Applied Mathematics
- computational geometry
- geometric object representation
- linear constraints
- linear programming