Extremal polygon containment problems
From MaRDI portal
Publication:1330463
DOI10.1016/0925-7721(94)90011-6zbMath0820.68125OpenAlexW2210521902MaRDI QIDQ1330463
Publication date: 21 July 1994
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(94)90011-6
Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (12)
Maximum-area and maximum-perimeter rectangles in polygons ⋮ Using sparsification for parametric minimum spanning tree problems ⋮ Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications ⋮ A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment ⋮ Approximation of convex figures by pairs of rectangles ⋮ An algorithm to find maximum area polygons circumscribed about a convex polygon ⋮ Largest triangles in a polygon ⋮ On critical orientations in the Kedem-Sharir motion planning algorithm ⋮ Covering points with a polygon ⋮ Approximating the maximum overlap of polygons under translation ⋮ Peeling meshed potatoes ⋮ A near-linear algorithm for the planar segment-center problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Parallel computational geometry
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Reporting and counting segment intersections
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Optimal Point Location in a Monotone Subdivision
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Point retrieval for polygons
- Linear Programming in Linear Time When the Dimension Is Fixed
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
- Parallelism in Comparison Problems
- Slowing down sorting networks to obtain faster sorting algorithms
This page was built for publication: Extremal polygon containment problems
