Computing minimum-area rectilinear convex hull and L-shape

DOI10.1016/J.COMGEO.2009.02.006MaRDI QIDQ833717zbMATH OpenOpenAlexFDO

Authors Sang Won Bae, Chunseok Lee, Hee-Kap Ahn, Kyung-Yong Chwa, Sung Hee Choi

Publication date 14 August 2009

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2009.02.006

zbMATH Keywords

algorithmcomputational geometrynon-convex optimizationshape optimizationextremal points\(L\)-shapeenclosing shapesrectilinear convex hullstaircases

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Optimization of shapes other than minimal surfaces (49Q10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• Rectilinear convex hull with minimum area
• On minimum-area hulls
• On minimum-area hulls (extended abstract)

Cites work

• scientific article; zbMATH DE number 4206040 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Convex hulls of finite sets of points in two and three dimensions
• Efficient partition trees
• On functional separately convex hulls
• On the X-Y convex hull of a set of X-Y polygons
• On the definition and computation of rectilinear convex hulls
• Range searching with efficient hierarchical cuttings
• Scanline algorithms on a grid

Cited in

(18)

• Rectilinear convex hull with minimum area
• Maximum-area and maximum-perimeter rectangles in polygons
• Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• Empty squares in arbitrary orientation among points
• Rectilinear convex hull of points in 3D and applications
• Fitting a two-joint orthogonal chain to a point set
• Computing min-convex hulls in the affine building of \(\mathrm{SL}_d\)
• A new algorithm for the minimal-area convex enclosure problem
• scientific article; zbMATH DE number 742951 (Why is no real title available?)
• One approach to constructing a minimal convex hull
• On the \(\mathcal{O}_\beta\)-hull of a planar point set
• Separating bichromatic point sets in the plane by restricted orientation convex hulls
• Covering a point set by two disjoint rectangles
• Computing a minimum-width cubic and hypercubic shell
• Set estimation under biconvexity restrictions
• Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
• Implementation of linear minimum area enclosing triangle algorithm. Application note

This page was built for publication: Computing minimum-area rectilinear convex hull and \(L\)-shape

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