Add to ORKGAbstract We give space-efficient geometric algorithms for threerelated problems. Given a set of n axis-aligned rectan-gles in the plane, we calculate the area covered by the union of these rectangles (Klee's measure problem) in O(n3/2 log n) time with O(pn) extra space. If the inputcan be destroyed and there are no degenerate cases and input coordinates are all integers, we can solve Klee'smeasure problem in O(n log2 n) time with O(log2 n) ex-tra space. Given a set of n points in the plane, we findthe axis-aligned unit square that covers the maximum number of points in O(n log3 n) time with O(log2 n) ex-tra space
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer sp...
Let $S$ be a set of $n$ points in $d$-space, let $R$ be an axes-parallel hyper-rectangle and let $1 ...
A well-known problem in computational geometry is Klee's measure problem, which asks for the volume ...
AbstractGiven n axis-parallel boxes in a fixed dimension d⩾3, how efficiently can we compute the vol...
We present a new algorithm for a classic problem in computational geometry, Klee’s measure problem: ...
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assum...
AbstractThe measure problem of Klee asks for the volume of the union of n axis-parallel boxes in a f...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer sp...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the small...
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer sp...
AbstractWe develop a number of space-efficient tools including an approach to simulate divide-and-co...
A well-known problem in computational geometry is Klee’s measure problem, which asks for the volume ...
We study three covering problems in the plane. Our original motivation for these problems comes from...
For a set of n points in the plane, we consider the axis-aligned (p; k)-Box COVERING problem: Find p...
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer sp...
Let $S$ be a set of $n$ points in $d$-space, let $R$ be an axes-parallel hyper-rectangle and let $1 ...
A well-known problem in computational geometry is Klee's measure problem, which asks for the volume ...
AbstractGiven n axis-parallel boxes in a fixed dimension d⩾3, how efficiently can we compute the vol...
We present a new algorithm for a classic problem in computational geometry, Klee’s measure problem: ...
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assum...
AbstractThe measure problem of Klee asks for the volume of the union of n axis-parallel boxes in a f...
Given a set S of n points in the plane, the disjoint two-rectangle covering problem is to find a pai...
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer sp...
Let P be a set of n points in the plane. We show how to find, for a given integer k>0 , the small...
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer sp...
AbstractWe develop a number of space-efficient tools including an approach to simulate divide-and-co...
A well-known problem in computational geometry is Klee’s measure problem, which asks for the volume ...
We study three covering problems in the plane. Our original motivation for these problems comes from...
For a set of n points in the plane, we consider the axis-aligned (p; k)-Box COVERING problem: Find p...
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer sp...
Let $S$ be a set of $n$ points in $d$-space, let $R$ be an axes-parallel hyper-rectangle and let $1 ...
A well-known problem in computational geometry is Klee's measure problem, which asks for the volume ...