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)
Let A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensional affi...
Given a subdivision of the plane induced by a planar graph with n vertices, in this paper the proble...
AbstractLet A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensio...
AbstractSuppose there are k sets each containing n lines in the plane. One might be interested in lo...
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...
During the last approximately 12 years, sweeping-plane techniques in a linear space ℝd have become a...
Topological sweep can contribute to efficient implementations of various algorithms for data analysi...
AbstractWe present a space-efficient algorithm for reporting all k intersections induced by a set of...
AbstractWe present a novel, simple and easily implementable algorithm to report all intersections in...
AbstractSweeping a collection of figures in the Euclidean plane with a straight line is one of the n...
The paper describes an algorithm for constructing the topology from a set of line segments or polyli...
We present a new simple algorithm for computing all intersections between two collections of disjoin...
The paper presents a new robust method for finding points of intersection of line segments in the pl...
The lines in 2D images are underlying metadata of many applications in the photogrammetry and visual...
AbstractFinding the closest or farthest line segment (line) from a point are fundamental proximity p...
Let A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensional affi...
Given a subdivision of the plane induced by a planar graph with n vertices, in this paper the proble...
AbstractLet A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensio...
AbstractSuppose there are k sets each containing n lines in the plane. One might be interested in lo...
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...
During the last approximately 12 years, sweeping-plane techniques in a linear space ℝd have become a...
Topological sweep can contribute to efficient implementations of various algorithms for data analysi...
AbstractWe present a space-efficient algorithm for reporting all k intersections induced by a set of...
AbstractWe present a novel, simple and easily implementable algorithm to report all intersections in...
AbstractSweeping a collection of figures in the Euclidean plane with a straight line is one of the n...
The paper describes an algorithm for constructing the topology from a set of line segments or polyli...
We present a new simple algorithm for computing all intersections between two collections of disjoin...
The paper presents a new robust method for finding points of intersection of line segments in the pl...
The lines in 2D images are underlying metadata of many applications in the photogrammetry and visual...
AbstractFinding the closest or farthest line segment (line) from a point are fundamental proximity p...
Let A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensional affi...
Given a subdivision of the plane induced by a planar graph with n vertices, in this paper the proble...
AbstractLet A(H) be the arrangement of a set H of n hyperplanes in d-space. A k-flat is a k-dimensio...
DOI
Add to ORKG