Simultaneous inner and outer approximation of shapes
From MaRDI portal
A new metric is introduced on the set of compact Euclidean bodies: for two of them \(L(P,Q)\) is the smallest ratio \(r/s\) of scaling factors \(r>0\), \(s>0\) where \(sQ'\subseteq R\subseteq rQ\) and \(Q'\), \(Q\) are translates of \(Q\). This is motivated by design of heuristic algorithms for motion planning and object placement problems. Estimates and efficient algorithms are given for the cases where \(P\) is a convex polygon and \(Q\) is a triangle. Upper bounds for other \(k\)-gons are also considered.
Recommendations
Cites work
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- scientific article; zbMATH DE number 4206040 (Why is no real title available?)
- scientific article; zbMATH DE number 4149525 (Why is no real title available?)
- scientific article; zbMATH DE number 3822577 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- scientific article; zbMATH DE number 3083197 (Why is no real title available?)
- Minimum area circumscribing polygons
- Simultaneous inner and outer approximation of shapes
- The Shapes of Polyhedra
- Über die affine Exzentrizität konvexer Körper
Cited in
(23)- On the maximum area pentagon in a planar point set
- The convergence rate of the sandwich algorithm for approximating convex functions
- Simultaneous inner and outer approximation of shapes
- Approximation of convex figures by pairs of rectangles
- On Banach-Mazur distance between planar convex bodies
- Largest and smallest area triangles on imprecise points
- Largest triangles in a polygon
- On the maximum area of inscribed polygons
- On an empty triangle with the maximum area in planar point sets
- On the shortest separating cycle
- A conjecture on line transversals to five unit discs
- Inner and outer approximation of convex sets using alignment
- Efficient lattice width computation in arbitrary dimension
- Approximation of convex bodies by axially symmetric bodies
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- Polytope approximation and the Mahler volume
- Approximation of quadrilaterals by triangles with respect to minimal width
- Computing efficiently the lattice width in any dimension
- Largest similar copies of convex polygons in polygonal domains
- On the Banach-Mazur distance in small dimensions
- Approximation of convex bodies by inscribed simplices of maximum volume
- Modeling time and topology for animation and visualization with examples on parametric geometry
- On maximum area polygons in a planar point set
This page was built for publication: Simultaneous inner and outer approximation of shapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201744)
