Recognition of largest empty orthoconvex polygon in a point set
From MaRDI portal
Publication:407528
DOI10.1016/j.ipl.2010.05.028zbMath1234.68444OpenAlexW1994974749MaRDI QIDQ407528
Krishnendu Mukhopadhyaya, Subhas C. Nandy, Bhargab Bikram 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
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Widest empty L-shaped corridor
- Finding the largest area axis-parallel rectangle in a polygon
- Improved algorithm for the widest empty 1-corner corridor
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- Extremal problems for convex polygons
- 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.
- Finding Extremal Polygons
- Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections