Enclosing a Set of Objects by Two Minimum Area Rectangles

DOI10.1006/JAGM.1996.0057MaRDI QIDQ3837385zbMATH OpenOpenAlexFDO

Authors Bruno Becker, Stephan Gschwind, Thomas Ohler, Paolo G. Franciosa, Stefano Leonardi, Peter Widmayer

Publication date 22 June 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0057

zbMATH Keywords

geometric data structure

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 176570
• Covering a Point Set by Two Disjoint Rectangles
• Enclosing k points in the smallest axis parallel rectangle
• Approximating minimum-area rectangular and convex containers for packing convex polygons

Cited in

(11)

• Enclosing many boxes by an optimal pair of boxes
• scientific article; zbMATH DE number 5369649 (Why is no real title available?)
• Parallel enclosing rectangle on SIMD machines
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
• Aligning two convex figures to minimize area or perimeter
• Algorithms for subpath convex hull queries and ray-shooting among segments
• scientific article; zbMATH DE number 5369695 (Why is no real title available?)
• Dynamic convex hulls under window-sliding updates
• scientific article; zbMATH DE number 176570 (Why is no real title available?)
• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set

This page was built for publication: Enclosing a Set of Objects by Two Minimum Area Rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837385)