Recognition of largest empty orthoconvex polygon in a point set

DOI10.1016/J.IPL.2010.05.028MaRDI QIDQ407528zbMATH OpenOpenAlexFDO

Authors Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya

Publication date 27 March 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.05.028

zbMATH Keywords

algorithm complexitycomputational geometryorthoconvex polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 4213490
• On empty convex polygons in a planar point set
• On empty convex polygons in a planar point set
• Faster counting empty convex polygons in a planar point set
• Large empty convex polygons in \(k\)-convex sets
• Disjoint empty convex polygons in planar point sets
• Searching for empty convex polygons
• Planar point sets with a small number of empty convex polygons
• Partitioning a planar point set into empty convex polygons

Cites work

• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Extremal problems for convex polygons
• Finding Extremal Polygons
• Finding the largest area axis-parallel rectangle in a polygon
• scientific article; zbMATH DE number 4213490 (Why is no real title available?)
• scientific article; zbMATH DE number 2077118 (Why is no real title available?)
• Improved algorithm for the widest empty 1-corner corridor
• On finding an empty staircase polygon of largest area (width) in a planar point-set
• Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections
• Widest empty L-shaped corridor

Cited in

(3)

• Finding the maximum empty axis-parallel rectangular annulus
• scientific article; zbMATH DE number 4213490 (Why is no real title available?)
• Maximum rectilinear convex subsets

This page was built for publication: Recognition of largest empty orthoconvex polygon in a point set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407528)