Pages that link to "Item:Q676593"
From MaRDI portal
The following pages link to Finding the largest area axis-parallel rectangle in a polygon (Q676593):
Displaying 19 items.
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- Finding the largest area rectangle of arbitrary orientation in a closed contour (Q440979) (← links)
- Largest inscribed rectangles in convex polygons (Q450533) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
- Finding largest rectangles in convex polygons (Q902427) (← links)
- Computing a maximum axis-aligned rectangle in a convex polygon (Q1334640) (← links)
- Finding a largest rectangle inside a digital object and rectangularization (Q1747507) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- On finding widest empty curved corridors (Q2385694) (← links)
- DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION (Q3401890) (← links)
- Placing Text Boxes on Graphs (Q3611861) (← links)
- Motion Smoothing Strategies for 2D Video Stabilization (Q4686915) (← links)
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS (Q4818564) (← links)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon (Q5859625) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
