An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest

DOI10.1137/22M1482676MaRDI QIDQ5056924

Mar Ávila, Rubén Molano, Pablo G. Rodríguez, Andrés Caro, José Carlos Sancho

Publication date: 8 December 2022

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

zbMATH Keywords

areaperimetersimple polygonregion of interest\(k\)-gon

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the largest area rectangle of arbitrary orientation in a closed contour
• Largest inscribed rectangles in convex polygons
• Finding the largest area axis-parallel rectangle in a polygon
• Maximum-area triangle in a convex polygon, revisited
• Minimum-perimeter enclosures
• A polynomial solution for the Potato-peeling problem
• Geometric applications of a matrix-searching algorithm
• On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato
• Finding a largest rectangle inside a digital object and rectangularization
• Minimum area circumscribing polygons
• Fareys series and Pick's area theorem
• The simple grid polygon exploration problem
• Finding Extremal Polygons
• Finding large sticks and potatoes in polygons
• Finding the smallest triangles containing a given convex polygon
• An optimal algorithm for finding minimal enclosing triangles
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Polygon Area Decomposition for Multiple-Robot Workspace Division
• Discrete and Computational Geometry

This page was built for publication: An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest