A new scheme for finding the biggest rectangle that doesn`t have any obstacle
The KIPS Transactions:PartA, Vol. 18, No. 2, pp. 75-80, Apr. 2011
10.3745/KIPSTA.2011.18.2.75, PDF Download:
Abstract
Statistics
Show / Hide Statistics
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.
|
Cite this article
[IEEE Style]
J. H. Hwang and H. S. Jeon, "A new scheme for finding the biggest rectangle that doesn`t have any obstacle," The KIPS Transactions:PartA, vol. 18, no. 2, pp. 75-80, 2011. DOI: 10.3745/KIPSTA.2011.18.2.75.
[ACM Style]
Jung Hwan Hwang and Heung Seok Jeon. 2011. A new scheme for finding the biggest rectangle that doesn`t have any obstacle. The KIPS Transactions:PartA, 18, 2, (2011), 75-80. DOI: 10.3745/KIPSTA.2011.18.2.75.