AbstractGiven a rectangle A and a set S of n points in A, the maximum empty rectangle problem is that of finding a largest-area rectangle which is contained in A, has its sides parallel to those of A, and does not contain any of the points in S. This note describes an efficient algorithm for solving this problem
We study the problem of finding maximum-area and maximum-perimeter rectangles that are inscribed in ...
This column is devoted to maximal empty axis-parallel rectangles amidst a point set. In particular, ...
Given a set of n points S in the Euclidean plane, we address the problem of computing an annulus A, ...
AbstractGiven a rectangle A and a set S of n points in A, we consider the problem, called the maximu...
AbstractGiven a rectangle A and a set S of n points in A, the maximum empty rectangle problem is tha...
Let be a set of points located in a rectangle and is a point that is not in . This article descri...
We consider the following problem: Given a rectangle containing N points, find the largest area subr...
Geometric optimization, which has emerged as an important line of research within the field of Compu...
We consider the following problem: Given a rectangle containing N points, find the largest area subr...
We consider the following problem: Given a rectangle containing N points, find the largest area subr...
We revisit the following problem (along with its higher dimensional variant): Given a set S of n poi...
Abstract. Given a two-dimensional space, let S be a set of points stored in an R-tree, let R be the ...
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values i...
Let be a set of points located in a rectangle and is a point that is not in . This article descri...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
We study the problem of finding maximum-area and maximum-perimeter rectangles that are inscribed in ...
This column is devoted to maximal empty axis-parallel rectangles amidst a point set. In particular, ...
Given a set of n points S in the Euclidean plane, we address the problem of computing an annulus A, ...
AbstractGiven a rectangle A and a set S of n points in A, we consider the problem, called the maximu...
AbstractGiven a rectangle A and a set S of n points in A, the maximum empty rectangle problem is tha...
Let be a set of points located in a rectangle and is a point that is not in . This article descri...
We consider the following problem: Given a rectangle containing N points, find the largest area subr...
Geometric optimization, which has emerged as an important line of research within the field of Compu...
We consider the following problem: Given a rectangle containing N points, find the largest area subr...
We consider the following problem: Given a rectangle containing N points, find the largest area subr...
We revisit the following problem (along with its higher dimensional variant): Given a set S of n poi...
Abstract. Given a two-dimensional space, let S be a set of points stored in an R-tree, let R be the ...
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values i...
Let be a set of points located in a rectangle and is a point that is not in . This article descri...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
We study the problem of finding maximum-area and maximum-perimeter rectangles that are inscribed in ...
This column is devoted to maximal empty axis-parallel rectangles amidst a point set. In particular, ...
Given a set of n points S in the Euclidean plane, we address the problem of computing an annulus A, ...
DOI
Add to ORKG