Computing minimum-area rectilinear convex hull and \(L\)-shape

DOI10.1016/j.comgeo.2009.02.006zbMath1175.49035OpenAlexW1995521671MaRDI QIDQ833717

Kyung-Yong Chwa, Chunseok Lee, Hee-Kap Ahn, Sang Won Bae, 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

algorithmshape optimizationnon-convex optimizationcomputational geometryextremal points\(L\)-shapeenclosing shapesrectilinear convex hullstaircases

Mathematics Subject Classification ID

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

Related Items

Maximum-area and maximum-perimeter rectangles in polygons ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms ⋮ On the \(\mathcal{O}_\beta\)-hull of a planar point set ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ Empty squares in arbitrary orientation among points ⋮ Set estimation under biconvexity restrictions ⋮ Rectilinear Convex Hull with Minimum Area ⋮ Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations ⋮ COVERING A POINT SET BY TWO DISJOINT RECTANGLES

Cites Work

• Range searching with efficient hierarchical cuttings
• On the definition and computation of rectilinear convex hulls
• On the X-Y convex hull of a set of X-Y polygons
• Scanline algorithms on a grid
• Efficient partition trees
• On functional separately convex hulls
• Convex hulls of finite sets of points in two and three dimensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item