AbstractWe present a space-efficient algorithm for reporting all k intersections induced by a set of n line segments in the plane. Our algorithm is an in-place variant of Balaban's algorithm and, in the worst case, runs in O(nlog2n+k) time using O(1) extra words of memory in addition to the space used for the input to the algorithm
In this thesis we describe a new algorithm, SPAGHETTISWEEP, for solving the red-blue line segment i...
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm based ...
AbstractWe describe the first optimal randomized in-place algorithm for the basic 3-d convex hull pr...
AbstractWe present a space-efficient algorithm for reporting all k intersections induced by a set of...
AbstractThis paper partly settles the following question: Is it possible to compute all k intersecti...
金沢大学This paper presents an efficient algorithm for reporting all intersections among n given segment...
AbstractWe develop a number of space-efficient tools including an approach to simulate divide-and-co...
We present a new simple algorithm for computing all intersections between two collections of disjoin...
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assum...
AbstractThe fundamental problem of finding all intersections among a set of line segments in the pla...
AbstractA simple intersection sensitive algorithm for the hidden line elimination problem, was prese...
We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illus...
We consider whether restricted sets of geometric predicates support efficient algorithms to solve li...
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a ...
AbstractWe consider whether restricted sets of geometric predicates support efficient algorithms to ...
In this thesis we describe a new algorithm, SPAGHETTISWEEP, for solving the red-blue line segment i...
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm based ...
AbstractWe describe the first optimal randomized in-place algorithm for the basic 3-d convex hull pr...
AbstractWe present a space-efficient algorithm for reporting all k intersections induced by a set of...
AbstractThis paper partly settles the following question: Is it possible to compute all k intersecti...
金沢大学This paper presents an efficient algorithm for reporting all intersections among n given segment...
AbstractWe develop a number of space-efficient tools including an approach to simulate divide-and-co...
We present a new simple algorithm for computing all intersections between two collections of disjoin...
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assum...
AbstractThe fundamental problem of finding all intersections among a set of line segments in the pla...
AbstractA simple intersection sensitive algorithm for the hidden line elimination problem, was prese...
We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illus...
We consider whether restricted sets of geometric predicates support efficient algorithms to solve li...
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a ...
AbstractWe consider whether restricted sets of geometric predicates support efficient algorithms to ...
In this thesis we describe a new algorithm, SPAGHETTISWEEP, for solving the red-blue line segment i...
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm based ...
AbstractWe describe the first optimal randomized in-place algorithm for the basic 3-d convex hull pr...
DOI
Add to ORKG