The following pages link to Finding Extremal Polygons (Q3221405):
Displaying 30 items.
- Asymmetric polygons with maximum area (Q320859) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Maximum-area triangle in a convex polygon, revisited (Q783698) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- Minimum-perimeter enclosures (Q963415) (← links)
- Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes (Q990126) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- Parallel computational geometry (Q1115600) (← links)
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems (Q1123609) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Finding the closest extreme vertex to a fixed point (Q1199551) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- On finding an empty staircase polygon of largest area (width) in a planar point-set (Q1405008) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- Minimum area circumscribing polygons (Q1822239) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Extremal convex polygons inscribed in a given convex polygon (Q2064020) (← links)
- Characterization of extremal antipodal polygons (Q2345506) (← links)
- Hausdorff approximation of convex polygons (Q2573338) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS (Q4762908) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets (Q5266598) (← links)
- Optimal Embedded and Enclosing Isosceles Triangles (Q6066459) (← links)
- Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms (Q6090986) (← links)
