找到包含空间中所有点的最大空矩形的集合 [英] Finding the set containing maximum empty rectangles for all the points in space

问题描述

给定一个由(白色)矩形和一组占据该空间的(黑色)矩形限制的 2D 空间，我正在寻找一种以某种方式索引空(白色)空间的方法.为此，我想创建一组(白色)矩形，以便对于空间中的任何给定点(不属于任何黑色"矩形的点)在该白色矩形结果集中存在最大的空矩形.

Given a 2D space limited by a (white) rectangle and a set of (black) rectangles occupying that space I am looking for a way to somehow index the empty (white) space. For that purpose I would like to create a set of (white) rectangles such that for any given point in the space (point not belonging to any "black" rectangle) maximal empty rectangle exists in that resulting set of white rectangles.

谢谢

推荐答案

http://rd.springer.com/chapter/10.1007%2F3-540-53487-3_50这篇论文描述了一种有效的方法来解决我的问题.

http://rd.springer.com/chapter/10.1007%2F3-540-53487-3_50 This paper describes an efficient approach to my problem.

问候，达姆扬

这篇关于找到包含空间中所有点的最大空矩形的集合的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！