Article thumbnail

Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D

By Minati De and Subhas C. Nandy

Abstract

In this paper, we consider the problem of designing in-place algorithms for computing the maximum area empty rectangle of arbitrary orientation among a set of points in 2D, and the maximum volume empty axisparallel cuboid among a set of points in 3D. If n points are given in an array of size n, the worst case time complexity of our proposed algorithms for both the problems is O(n³); both the algorithms use O(1) extra space in addition to the array containing the input points

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.381.2562
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cccg.ca/proceedings... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.