AbstractSuppose there are k sets each containing n lines in the plane. One might be interested in locating the points intersected by at least one line from each set. This paper describes an algorithm which locates all those vertices using O(kn2) time and O(kn) space. The method relies heavily on the topological plane sweep of Edelsbrunner and Guibas (1989)
Topological sweep can contribute to efficient implementations of various algorithms for data analysi...
We discuss certain open problems in the context of arrangements of lines in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
AbstractSuppose there are k sets each containing n lines in the plane. One might be interested in lo...
AbstractSweeping a collection of figures in the Euclidean plane with a straight line is one of the n...
AbstractWe present a novel, simple and easily implementable algorithm to report all intersections in...
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm based ...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
Let L be a set of n lines in the plane. The zone Z(ℓ) of a line ℓ in the arrangement A(L) of L is th...
We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We appl...
金沢大学This paper presents an efficient algorithm for construction at-most-k levels of an arrangement o...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
AbstractThe problem of computing a representation of the stabbing lines of a set S of segments in th...
Topological sweep can contribute to efficient implementations of various algorithms for data analysi...
We discuss certain open problems in the context of arrangements of lines in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
AbstractSuppose there are k sets each containing n lines in the plane. One might be interested in lo...
AbstractSweeping a collection of figures in the Euclidean plane with a straight line is one of the n...
AbstractWe present a novel, simple and easily implementable algorithm to report all intersections in...
We describe a robust and efficient implementation of the Bentley-Ottmann sweep line algorithm based ...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
For a set S of n line segments in the plane, we give the first work-optimal deterministic parallel a...
Let L be a set of n lines in the plane. The zone Z(ℓ) of a line ℓ in the arrangement A(L) of L is th...
We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We appl...
金沢大学This paper presents an efficient algorithm for construction at-most-k levels of an arrangement o...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
AbstractThe problem of computing a representation of the stabbing lines of a set S of segments in th...
Topological sweep can contribute to efficient implementations of various algorithms for data analysi...
We discuss certain open problems in the context of arrangements of lines in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
DOI
Add to ORKG