Computing a convex skill of an orthogonal polygon

  • Authors:

  • Derick Wood;Chee K. Yap

  • Affiliations:

  • Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY

  • Venue:
  • SCG '85 Proceedings of the first annual symposium on Computational geometry
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a simple orthogonal polygon, that is a simple polygon whose edges are parallel to the axes, we wish to determine an inscribed convex orthogonal polygon of maximal area. This is the orthogonal version of the potato peeling problem. We present an &Ogr;(n2) time algorithm to solve it, which is a substantial improvement over the &Ogr;(n7 time algorithm for the general problem.