Add to ORKGWe present an algorithm that determines, in expected O(n 2) time, whether a line exists that stabs each of a set of oriented convex polygons in R 3 with a total of n edges. If a stabbing line exists, the algorithm computes at least one such line. We show that the computation amounts to constructing a convex polytope in R 5 and inspecting its edges for intersections with a four-dimensional quadric surface, the Plucker quadric
Abstract. We propose a randomized method for general convex optimization problems; namely, the minim...
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...
AbstractA line ℓ is called a stabbling line for a set Bof convex polyhedra in R3 if it intersects ev...
Abstract. We consider a natural variation of the concept of stabbing a set of segments with a simple...
We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: ...
AbstractGiven a set of geometric objects in Rd, the hyperplane transversal or stabbing problem is to...
Abstract. We consider a natural variation of the concept of stabbing a segment by a simple polygon: ...
AbstractAn algorithm is presented for determining inO(n log n) time whether there exists a line that...
We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment ...
Given a set S of disjoint simple polygons on a bounded 2D-Plane, we studied the problem of finding a...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
AbstractAn algorithm is presented for determining inO(n log n) time whether there exists a line that...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we cons...
Abstract. We propose a randomized method for general convex optimization problems; namely, the minim...
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...
AbstractA line ℓ is called a stabbling line for a set Bof convex polyhedra in R3 if it intersects ev...
Abstract. We consider a natural variation of the concept of stabbing a set of segments with a simple...
We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: ...
AbstractGiven a set of geometric objects in Rd, the hyperplane transversal or stabbing problem is to...
Abstract. We consider a natural variation of the concept of stabbing a segment by a simple polygon: ...
AbstractAn algorithm is presented for determining inO(n log n) time whether there exists a line that...
We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment ...
Given a set S of disjoint simple polygons on a bounded 2D-Plane, we studied the problem of finding a...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
AbstractAn algorithm is presented for determining inO(n log n) time whether there exists a line that...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is fas...
Stabbing a set S of n segments in the plane by a line is a well-known problem. In this paper we cons...
Abstract. We propose a randomized method for general convex optimization problems; namely, the minim...
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...
AbstractA line ℓ is called a stabbling line for a set Bof convex polyhedra in R3 if it intersects ev...