Computing minimum-area rectilinear convex hull and L-shape
DOI10.1016/J.COMGEO.2009.02.006zbMATH Open1175.49035OpenAlexW1995521671MaRDI QIDQ833717FDOQ833717
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
Recommendations
algorithmcomputational geometrynon-convex optimizationshape optimizationextremal points\(L\)-shapeenclosing shapesrectilinear convex hullstaircases
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)
Cites Work
- Efficient partition trees
- Title not available (Why is that?)
- On the definition and computation of rectilinear convex hulls
- Scanline algorithms on a grid
- On functional separately convex hulls
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex hulls of finite sets of points in two and three dimensions
- Range searching with efficient hierarchical cuttings
- On the X-Y convex hull of a set of X-Y polygons
- Title not available (Why is that?)
Cited In (18)
- Set estimation under biconvexity restrictions
- Maximum-area and maximum-perimeter rectangles in polygons
- Implementation of linear minimum area enclosing triangle algorithm. Application note
- Empty squares in arbitrary orientation among points
- A new algorithm for the minimal-area convex enclosure problem
- Computing min-convex hulls in the affine building of \(\mathrm{SL}_d\)
- One approach to constructing a minimal convex hull
- Title not available (Why is that?)
- Rectilinear convex hull of points in 3D and applications
- Fitting a two-joint orthogonal chain to a point set
- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
- Covering a point set by two disjoint rectangles
- Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Computing a minimum-width cubic and hypercubic shell
- On the \(\mathcal{O}_\beta\)-hull of a planar point set
- Rectilinear convex hull with minimum area
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)
