Given a set S of n disjoint convex polygons {Pi1in} in a plane, each with ki vertices, the transversal problem is to find, if there exists one, a straight line that goes through every polygon in S. We show that the transversal problem can be solved in O(N+nlogn) time, where N=∑i=1nki is the total number of vertices of the polygons.Francis Y. L. Chin, Hong Shen, and Fu Lee Wan
AbstractLet S be a family of n translates of a centrally symmetric convex set in the plane such that...
Given a set S of n points in the plane, we compute in time O(n 3) the total number of convex polygon...
Given a set S of n points in the plane, we compute in time O(n3) the total number of convex polygons...
An efficient algorithm for solving transversal of n disjoint convex polygons with a total of N verti...
Consider the following fundamental geometric problem: given a family of convex sets in the plane, do...
Let $ be used to denote a finite set of planar geometric objects. Define a polygon transversal of $...
AbstractA straight line that intersects all members of a set S of objects in the real plane is calle...
AbstractA straight line that intersects all members of a set S of objects in the real plane is calle...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
\u3cp\u3eWe consider the problem of testing, for a given set of planar regions R and an integer k, w...
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, w...
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, w...
AbstractLet S be a family of n translates of a centrally symmetric convex set in the plane such that...
Given a set S of n points in the plane, we compute in time O(n 3) the total number of convex polygon...
Given a set S of n points in the plane, we compute in time O(n3) the total number of convex polygons...
An efficient algorithm for solving transversal of n disjoint convex polygons with a total of N verti...
Consider the following fundamental geometric problem: given a family of convex sets in the plane, do...
Let $ be used to denote a finite set of planar geometric objects. Define a polygon transversal of $...
AbstractA straight line that intersects all members of a set S of objects in the real plane is calle...
AbstractA straight line that intersects all members of a set S of objects in the real plane is calle...
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
\u3cp\u3eWe consider the problem of testing, for a given set of planar regions R and an integer k, w...
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, w...
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, w...
AbstractLet S be a family of n translates of a centrally symmetric convex set in the plane such that...
Given a set S of n points in the plane, we compute in time O(n 3) the total number of convex polygon...
Given a set S of n points in the plane, we compute in time O(n3) the total number of convex polygons...
DOI
Add to ORKG