Extremal polygon containment problems
From MaRDI portal
Recommendations
- Extremal problems for convex polygons
- Containment problems for polytopes and spectrahedra
- scientific article; zbMATH DE number 653187
- Containment of a single polygon using mathematical programming
- An extremum problem for convex polygons
- Extremal problems for framed polygons
- Extremal problems in discrete geometry
- scientific article; zbMATH DE number 7564043
- scientific article; zbMATH DE number 5589231
Cites work
- scientific article; zbMATH DE number 3911704 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4051003 (Why is no real title available?)
- scientific article; zbMATH DE number 742950 (Why is no real title available?)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
- Optimal Point Location in a Monotone Subdivision
- Parallel computational geometry
- Parallelism in Comparison Problems
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Point retrieval for polygons
- Reporting and counting segment intersections
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Slowing down sorting networks to obtain faster sorting algorithms
Cited in
(19)- Containment problems for polytopes and spectrahedra
- A near-linear algorithm for the planar segment-center problem
- Maximum-area and maximum-perimeter rectangles in polygons
- Largest triangles in a polygon
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- On critical orientations in the Kedem-Sharir motion planning algorithm
- Covering points with a polygon
- Algorithms for deciding the containment of polygons
- Finding Extremal Polygons
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- The containment problem and a rational simplicial arrangement
- scientific article; zbMATH DE number 4173033 (Why is no real title available?)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- Approximating the maximum overlap of polygons under translation
- Peeling meshed potatoes
- Approximation of convex figures by pairs of rectangles
- Matching convex polygons and polyhedra, allowing for occlusion
- A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
- Using sparsification for parametric minimum spanning tree problems
This page was built for publication: Extremal polygon containment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330463)
