Simultaneous inner and outer approximation of shapes
From MaRDI portal
Publication:1201744
DOI10.1007/BF01758852zbMath0760.68083OpenAlexW1984482678WikidataQ54309584 ScholiaQ54309584MaRDI QIDQ1201744
Günter Rote, Rudolf Fleischer, Chee-Keng Yap, Kurt Mehlhorn, Ermo 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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Approximation of convex bodies by axially symmetric bodies, Inner and outer approximation of convex sets using alignment, OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS, Approximation of convex figures by pairs of rectangles, Approximation of quadrilaterals by triangles with respect to minimal width, Computing efficiently the lattice width in any dimension, Largest triangles in a polygon, Largest and smallest area triangles on imprecise points, On the maximum area of inscribed polygons, Modeling time and topology for animation and visualization with examples on parametric geometry, On maximum area polygons in a planar point set, The convergence rate of the sandwich algorithm for approximating convex functions, Simultaneous inner and outer approximation of shapes, On an empty triangle with the maximum area in planar point sets, Approximation of convex bodies by inscribed simplices of maximum volume, On Banach-Mazur distance between planar convex bodies, On the shortest separating cycle, On the maximum area pentagon in a planar point set, A conjecture on line transversals to five unit discs, Efficient Lattice Width Computation in Arbitrary Dimension, Unnamed Item
Cites Work
- Über die affine Exzentrizität konvexer Körper
- Simultaneous inner and outer approximation of shapes
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Minimum area circumscribing polygons
- The Shapes of Polyhedra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
