Finding Extremal Polygons
From MaRDI portal
Publication:3221405
DOI10.1137/0214011zbMath0557.68034OpenAlexW2052562833MaRDI QIDQ3221405
James E. Boyce, David P. Dobkin, Robert L. III Drysdale, Leonidas J. Guibas
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214011
Related Items
Finding a largest-area triangle in a terrain in near-linear time ⋮ Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications ⋮ An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ Asymmetric polygons with maximum area ⋮ Geometric applications of a matrix-searching algorithm ⋮ Parallel computational geometry ⋮ A note on lower bounds for the maximum area and maximum perimeter k-gon problems ⋮ All-maximum and all-minimum problems under some measures ⋮ Optimal Embedded and Enclosing Isosceles Triangles ⋮ Recognition of largest empty orthoconvex polygon in a point set ⋮ Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms ⋮ On finding an empty staircase polygon of largest area (width) in a planar point-set ⋮ Computing efficiently the lattice width in any dimension ⋮ Empty squares in arbitrary orientation among points ⋮ An algorithm to find maximum area polygons circumscribed about a convex polygon ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Finding minimum area \(k\)-gons ⋮ Largest and smallest area triangles on imprecise points ⋮ Geometric Knapsack problems ⋮ Minimum-perimeter enclosures ⋮ Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes ⋮ Extremal convex polygons inscribed in a given convex polygon ⋮ Minimum area circumscribing polygons ⋮ Efficient Lattice Width Computation in Arbitrary Dimension ⋮ Maximum-area triangle in a convex polygon, revisited ⋮ Hausdorff approximation of convex polygons ⋮ Characterization of extremal antipodal polygons ⋮ EFFICIENT APPROXIMATION OF CONVEX POLYGONS ⋮ An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets
