Finding Extremal Polygons
From MaRDI portal
Publication:3221405
Recommendations
- scientific article; zbMATH DE number 522850
- scientific article; zbMATH DE number 3854463
- An extremum problem for convex polygons
- Polygon vertex extremality and decomposition of polygons
- Extremal problems for convex polygons
- Extremal polygon containment problems
- Extremal polygons with minimal perimeter
- Characterization of extremal antipodal polygons
- Extremal convex polygons inscribed in a given convex polygon
Cited in
(42)- Finding extreme points in three dimensions and solving the post-office problem in the plane
- 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
- Finding minimum area \(k\)-gons
- Finding the closest extreme vertex to a fixed point
- Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- Crystals, gauges, podals, and polars.
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Minimum area circumscribing polygons
- Largest and smallest area triangles on imprecise points
- Using symbolic calculations to determine largest small polygons
- Extremal convex polygons inscribed in a given convex polygon
- Characterization of extremal antipodal polygons
- Hausdorff approximation of convex polygons
- Empty squares in arbitrary orientation among points
- scientific article; zbMATH DE number 434882 (Why is no real title available?)
- Asymmetric polygons with maximum area
- scientific article; zbMATH DE number 3854463 (Why is no real title available?)
- Efficient lattice width computation in arbitrary dimension
- All-maximum and all-minimum problems under some measures
- scientific article; zbMATH DE number 140473 (Why is no real title available?)
- Recognition of largest empty orthoconvex polygon in a point set
- scientific article; zbMATH DE number 522850 (Why is no real title available?)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- An Algorithm to Compute Any Simple k-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- Maximum rectilinear convex subsets
- An empirical study on randomized optimal area polygonization of planar point sets
- Finding the convex hull of a simple polygon
- Optimal Embedded and Enclosing Isosceles Triangles
- Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms
- Computing efficiently the lattice width in any dimension
- Sequential and parallel algorithms for finding a maximum convex polygon
- Global optimization for Heilbronn problem of convex polygons based on bilinear matrix inequalities solving
- Geometric Knapsack problems
- Finding a largest-area triangle in a terrain in near-linear time
- Maximum-area triangle in a convex polygon, revisited
- Finding a largest-area triangle in a terrain in near-linear time
- Minimum-perimeter enclosures
- Finding the maximum bounded intersection of k out of n halfplanes
This page was built for publication: Finding Extremal Polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221405)
