AbstractAn algorithm is presented for determining inO(n log n) time whether there exists a line that stabs each of n isothetic boxes or rectangles in R3. If any stabbing line exists, the algorithm computes and returns one such stabbing line
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
In the weighted rectangle stabbing problem we are given a grid in R² consisting of columns and rows ...
AbstractAn algorithm is presented for determining inO(n log n) time whether there exists a line that...
AbstractWe present in this paper a simple yet efficient algorithm for stabbing a set S of n axis-par...
Given a set of n line segments in the plane, we say that a region R of the plane is a stabber if R c...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the pl...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the pl...
We present an algorithm that determines, in expected O(n 2) time, whether a line exists that stabs e...
Given a set S of n line segments in the plane, we say that a region R¿R2 is a stabber for S if R...
We study rectangle stabbing problems in which we are given n axis-aligned rectangles in the plane th...
Given a set of n line segments in the plane, we say that a region R ⊆ R2 is a stabber if R contains ...
Given n horizontal segments, each associated with a color from [σ], the Categorical Segment Stabbing...
Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we cons...
AbstractGiven a set of geometric objects in Rd, the hyperplane transversal or stabbing problem is to...
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
In the weighted rectangle stabbing problem we are given a grid in R² consisting of columns and rows ...
AbstractAn algorithm is presented for determining inO(n log n) time whether there exists a line that...
AbstractWe present in this paper a simple yet efficient algorithm for stabbing a set S of n axis-par...
Given a set of n line segments in the plane, we say that a region R of the plane is a stabber if R c...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the pl...
We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the pl...
We present an algorithm that determines, in expected O(n 2) time, whether a line exists that stabs e...
Given a set S of n line segments in the plane, we say that a region R¿R2 is a stabber for S if R...
We study rectangle stabbing problems in which we are given n axis-aligned rectangles in the plane th...
Given a set of n line segments in the plane, we say that a region R ⊆ R2 is a stabber if R contains ...
Given n horizontal segments, each associated with a color from [σ], the Categorical Segment Stabbing...
Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we cons...
AbstractGiven a set of geometric objects in Rd, the hyperplane transversal or stabbing problem is to...
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
The problem of computing a representation of the stabbing lines of a set S of segments in the plane ...
In the weighted rectangle stabbing problem we are given a grid in R² consisting of columns and rows ...
DOI
Add to ORKG