Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams
Explore this paper's citation graph
Summary
The maximin placement of a convex polygon P inside a polygon Q is shown, and the dynamic Voronoi diagram of rigidly moving sets of n points is investigated, showing the combinatorial complexity of this canonical dynamic diagram.
- Type
- article
- Published
- 1990-05-01
- Cited by
- 32
- References
- 26
- Access
- Open access
- OpenAlex
- https://openalex.org/W640845238
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:3053016
Keywords
Voronoi diagram, Combinatorics, Minimax, Translation (biology), Regular polygon
References
- A Visual System of Placing Characters Appropriately in Multimedia Map Databases
- Polygon Placement Under Translation and Rotation
- On a problem of Davenport and Schinzel
- A Fast Algorithm for Polygon Containment by Translation (Extended Abstract)
- On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane
- Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Some dynamic computational geometry problems
- A sweepline algorithm for Voronoi diagrams
- Placing the largest similar copy of a convex polygon among polygonal obstacles
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Minimax geometric fitting of two corresponding sets of points
Cited by
- Continuous location of dimensional structures
- Voronoi diagrams—a survey of a fundamental geometric data structure
- On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane
- Ready, Set, Go! The Voronoi diagram of moving points that start from a line
- Locational optimization problems solved through Voronoi diagrams
- Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets
- Geometric Pattern Matching Under Euclidean Motion
- Voronoi Diagrams of Rigidly Moving Sets of Points
- Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
- Labeling Points with Rectangles of Various Shapes
- A Geometric Point Sets Pattern Matching by Motion Estimation
- The Anchored Voronoi Diagram: Static, Dynamic Versions and Applications
- Map Label Placement for Points and Curves
- A solution for a polygon containment problem using sorting X + Y.(Computational Geometry and Discrete Geometry)
- Continuous location model of a rectangular barrier facility
- Bi-objective Model for Optimal Number and Size of Circular Facilities
- Invited Review Continuous location of dimensional structures
- Sharp Bounds on Davenport-Schinzel Sequences of Every Order
- An Algorithmic Approach to Decorative Content Placement
- Combinatorial Geometry with Algorithmic Applications
Related papers
- Application of the Voronoi Diagram-Thiessen Polygon Method in Tree Surveying with Angle Gauges
- A Decomposition and Combination Algorithm for Voronoi Diagrams of Polylines and Polygons
- DEVELOPMENT OF A METHOD AND ALGORITHMS OF CALCULATION OF THE AREA OF A CONVEX POLYGON WITH THE USE OF COMBINATORICS
- Trajectory Optimization with Polygonal No-Fly Zone Constraints for Hypersonic Glide Vehicle
- Establishment of flight rerouting area and air route planning based on convex polygon
- Measuring regularity of convex polygons
- Planar polygons; Regular, convex, almost convex, staircase and row convex