On the maximum empty hyper-rectangle problem
Given a rectangle M containing points, we consider the problem of detecting the largest rectangle that is totally contained in M and does not include any of the points. In other words, we want to find the biggest hole in the dataset that can contain the biggest possible rectangle. A new algorithm fo...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2023-02-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1177/17483026221151197 |