Simultaneous inner and outer approximation of shapes
From MaRDI portal
Publication:1201744
DOI10.1007/BF01758852zbMATH Open0760.68083OpenAlexW1984482678WikidataQ54309584 ScholiaQ54309584MaRDI QIDQ1201744FDOQ1201744
Authors: Rudolf Fleischer, K. Mehlhorn, Günter Rote, Chee K. Yap, Emo Welzl
Publication date: 17 January 1993
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01758852
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simultaneous inner and outer approximation of shapes
- Minimum area circumscribing polygons
- Über die affine Exzentrizität konvexer Körper
- Title not available (Why is that?)
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Title not available (Why is that?)
- The Shapes of Polyhedra
Cited In (21)
- On the maximum area pentagon in a planar point set
- On an empty triangle with the maximum area in planar point sets
- On the shortest separating cycle
- Largest triangles in a polygon
- Approximation of quadrilaterals by triangles with respect to minimal width
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- Modeling time and topology for animation and visualization with examples on parametric geometry
- Approximation of convex bodies by axially symmetric bodies
- On maximum area polygons in a planar point set
- Polytope approximation and the Mahler volume
- On the maximum area of inscribed polygons
- On Banach-Mazur distance between planar convex bodies
- Inner and outer approximation of convex sets using alignment
- Computing efficiently the lattice width in any dimension
- Simultaneous inner and outer approximation of shapes
- Approximation of convex figures by pairs of rectangles
- Largest and smallest area triangles on imprecise points
- The convergence rate of the sandwich algorithm for approximating convex functions
- Efficient lattice width computation in arbitrary dimension
- Approximation of convex bodies by inscribed simplices of maximum volume
- A conjecture on line transversals to five unit discs
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)