Pages that link to "Item:Q833717"
From MaRDI portal
The following pages link to Computing minimum-area rectilinear convex hull and \(L\)-shape (Q833717):
Displaying 18 items.
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
- A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
- On minimum-area hulls (Q1386468) (← links)
- On the \(\mathcal{O}_\beta\)-hull of a planar point set (Q1699299) (← links)
- One approach to constructing a minimal convex hull (Q1759118) (← links)
- Implementation of linear minimum area enclosing triangle algorithm. Application note (Q2013616) (← links)
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
- Computing min-convex hulls in the affine building of \(\mathrm{SL}_d\) (Q2022629) (← links)
- Computing a minimum-width cubic and hypercubic shell (Q2294346) (← links)
- Separating bichromatic point sets in the plane by restricted orientation convex hulls (Q2694525) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
- (Q4763392) (← links)
- Rectilinear Convex Hull with Minimum Area (Q4899283) (← links)
- Set estimation under biconvexity restrictions (Q5140341) (← links)
- Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms (Q6090986) (← links)
- Rectilinear convex hull of points in 3D and applications (Q6618155) (← links)
