DOIAbstract
This column is devoted to maximal empty axis-parallel rectangles amidst a point set. In particular, among these, maximum-area rectangles are of interest
This column is devoted to maximal empty axis-parallel rectangles amidst a point set. In particular, among these, maximum-area rectangles are of interest
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 give the first efficient (1 − ε)-approximation algorithm for the following problem: Given an axis...
AbstractGiven a rectangle A and a set S of n points in A, the maximum empty rectangle problem is tha...
Geometric optimization, which has emerged as an important line of research within the field of Compu...
AbstractThis paper considers the geometric optimization problem of finding the Largest area axis-par...
This paper considers the geometric optimization problem of finding the Largest area axis-parallel Re...
We study the problem of finding maximum-area and maximum-perimeter rectangles that are inscribed in ...
In Euclidean plane, a rectangular annulus is the region between parallel rectangles such that the sm...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractGiven a rectangle A and a set S of n points in A, the maximum empty rectangle problem is tha...
A novel algorithm is presented which employs a projective extension of the Euclidean plane to identi...
AbstractGiven a rectangle A and a set S of n points in A, we consider the problem, called the maximu...
Abstract. Given a two-dimensional space, let S be a set of points stored in an R-tree, let R be the ...
We study the problem of finding maximum-area rectangles contained in a polygon in the plane. There h...
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 give the first efficient (1 − ε)-approximation algorithm for the following problem: Given an axis...
AbstractGiven a rectangle A and a set S of n points in A, the maximum empty rectangle problem is tha...
Geometric optimization, which has emerged as an important line of research within the field of Compu...
AbstractThis paper considers the geometric optimization problem of finding the Largest area axis-par...
This paper considers the geometric optimization problem of finding the Largest area axis-parallel Re...
We study the problem of finding maximum-area and maximum-perimeter rectangles that are inscribed in ...
In Euclidean plane, a rectangular annulus is the region between parallel rectangles such that the sm...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
AbstractGiven a rectangle A and a set S of n points in A, the maximum empty rectangle problem is tha...
A novel algorithm is presented which employs a projective extension of the Euclidean plane to identi...
AbstractGiven a rectangle A and a set S of n points in A, we consider the problem, called the maximu...
Abstract. Given a two-dimensional space, let S be a set of points stored in an R-tree, let R be the ...
We study the problem of finding maximum-area rectangles contained in a polygon in the plane. There h...
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 give the first efficient (1 − ε)-approximation algorithm for the following problem: Given an axis...
Add to ORKG