Computational geometry: an introduction
Computational geometry: an introduction
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Recognizing solid objects by alignment with an image
International Journal of Computer Vision
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
A convex polygon among polygonal obstacles: placement and high-clearance motion
Computational Geometry: Theory and Applications
Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry: Theory and Applications
Computing the smallest k-enclosing circle and related problems
Computational Geometry: Theory and Applications
Translating a convex polygon to contain a maximum number of points
Computational Geometry: Theory and Applications
Offset-polygon annulus placement problems
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Navigating Mobile Robots: Systems and Techniques
Navigating Mobile Robots: Systems and Techniques
Finding the Medial Axis of a Simple Polygon in Linear Time
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Covering points with a polygon
Computational Geometry: Theory and Applications
Efficient computation of continuous skeletons
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Medial Axis Transformation of a Planar Shape
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal placement of convex polygons to maximize point containment
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
The @d-annulus of a polygon P is the closed region containing all points in the plane at distance at most @d from the boundary of P. An inner (resp., outer) @d-offset polygon is the polygon defined by the inner (resp., outer) boundary of its @d-annulus. In this paper we address three major problems of covering a given point set S by an offset version or a polygonal annulus of a polygon P. First, the Maximum Cover objective is, given a value of @d, to cover as many points from S as possible by the @d-offset (or by the @d-annulus) of P, allowing translation and rotation. Second, the Containment problem is to minimize the value of @d such that there is a rigid transformation of the @d-offset (or the @d-annulus) of P that covers all points from S. Third, in the Partial Containment problem we seek the minimum offset of P covering k=