DOIAbstract
summary:Given $n$ rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper
summary:Given $n$ rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper
A rectangular dual of a graph G is a contact representation of G by axis-aligned rectangles such tha...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
10.1006/jpdc.1995.1076Journal of Parallel and Distributed Computing272107-117JPDC
summary:Given $n$ rectangles in a plane whose all sides belong to two perpendicular directions, an a...
In this paper the following geometric problem is considered. Let R1,...,Rm be rectangles on the plan...
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a giv...
We consider the problem of partitioning (in a certain manner) a rectangle into n regions of equal ar...
AbstractWe present a new incremental algorithm for constructing the union of n triangles in the plan...
Artículo de publicación ISIGiven a set of n axis-parallel rectangles in the plane, finding a maximum...
This paper continues with the subject matter that we introduced previously (Krishnamurti and Stouffs...
The union of axis-aligned boxes results in a constrained structure that is advantageous for solving ...
In Euclidean plane geometry there exists an interesting, although limited, duality between the conce...
Peng-Jun Wan ¢ We study the problem of separating £ points in the plane, no two of which have the sa...
Let S be a set of n points in the unit square [0, 1]2, one of which is the origin. We construct n pa...
We prove a near-linear bound on the combinatorial complexity of the union of n fat convex objects in...
A rectangular dual of a graph G is a contact representation of G by axis-aligned rectangles such tha...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
10.1006/jpdc.1995.1076Journal of Parallel and Distributed Computing272107-117JPDC
summary:Given $n$ rectangles in a plane whose all sides belong to two perpendicular directions, an a...
In this paper the following geometric problem is considered. Let R1,...,Rm be rectangles on the plan...
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a giv...
We consider the problem of partitioning (in a certain manner) a rectangle into n regions of equal ar...
AbstractWe present a new incremental algorithm for constructing the union of n triangles in the plan...
Artículo de publicación ISIGiven a set of n axis-parallel rectangles in the plane, finding a maximum...
This paper continues with the subject matter that we introduced previously (Krishnamurti and Stouffs...
The union of axis-aligned boxes results in a constrained structure that is advantageous for solving ...
In Euclidean plane geometry there exists an interesting, although limited, duality between the conce...
Peng-Jun Wan ¢ We study the problem of separating £ points in the plane, no two of which have the sa...
Let S be a set of n points in the unit square [0, 1]2, one of which is the origin. We construct n pa...
We prove a near-linear bound on the combinatorial complexity of the union of n fat convex objects in...
A rectangular dual of a graph G is a contact representation of G by axis-aligned rectangles such tha...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
10.1006/jpdc.1995.1076Journal of Parallel and Distributed Computing272107-117JPDC
Add to ORKG