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
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We investigate how to report all k intersecting pairs among a collection of n x-monotone curve segm...
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plan...
AbstractWe present a space-efficient algorithm for reporting all k intersections induced by a set of...
金沢大学This paper presents an efficient algorithm for reporting all intersections among n given segment...
AbstractThis paper partly settles the following question: Is it possible to compute all k intersecti...
We present a new simple algorithm for computing all intersections between two collections of disjoin...
AbstractThe fundamental problem of finding all intersections among a set of line segments in the pla...
In this thesis we describe a new algorithm, SPAGHETTISWEEP, for solving the red-blue line segment i...
This paper deals with a new deterministic algorithm for finding intersecting pairs from a given set ...
Abstract. We present a new line sweep algorithm, HeapSweep, for reporting bichromatic (`purple'...
Several robotic and computer vision applications depend upon the efficient determination of polygona...
AbstractA simple intersection sensitive algorithm for the hidden line elimination problem, was prese...
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm [1] ba...
AbstractWe investigate how to report all k intersecting pairs among a collection of n x-monotone cur...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We investigate how to report all k intersecting pairs among a collection of n x-monotone curve segm...
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plan...
AbstractWe present a space-efficient algorithm for reporting all k intersections induced by a set of...
金沢大学This paper presents an efficient algorithm for reporting all intersections among n given segment...
AbstractThis paper partly settles the following question: Is it possible to compute all k intersecti...
We present a new simple algorithm for computing all intersections between two collections of disjoin...
AbstractThe fundamental problem of finding all intersections among a set of line segments in the pla...
In this thesis we describe a new algorithm, SPAGHETTISWEEP, for solving the red-blue line segment i...
This paper deals with a new deterministic algorithm for finding intersecting pairs from a given set ...
Abstract. We present a new line sweep algorithm, HeapSweep, for reporting bichromatic (`purple'...
Several robotic and computer vision applications depend upon the efficient determination of polygona...
AbstractA simple intersection sensitive algorithm for the hidden line elimination problem, was prese...
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm [1] ba...
AbstractWe investigate how to report all k intersecting pairs among a collection of n x-monotone cur...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
We investigate how to report all k intersecting pairs among a collection of n x-monotone curve segm...
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plan...
DOI
Add to ORKG