Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



maximal empty axisparallel rectangle in a given region
Posted:
Nov 26, 2013 8:54 AM


Hi All,
I have come up with an algorithm for this problem, explained in the following link.
http://wilmott.com/messageview.cfm?catid=26&threadid=94283
It takes O(n*log(n)) time, O(n) space. No preprocessing time.
Can someone please tell me if this is good enough to be published? Is there a faster algorithm than this exist for this problem?
##################################################################
References:: 1. Augustine, J., Das, S., Maheshwari, A., Nandy, S. C., Roy, S., and Sarvat tomananda, S. Querying for the largest empty geometric object in a desired location. CoRR abs/1004.0558 (2010).
2. R. P. Boland and J. Urrutia, Finding the largest axis aligned rectangle in a polygon in O(n log n) time, Proc. of the Canad. Conf. on Computational Geometry, pp. 4144, 2001.
Thanks! Fritz Jacob



