230
click to vote
COMPGEOM
15 years 11 months ago
1991 ACM 
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
213
Voted
COMPGEOM
15 years 11 months ago
1991 ACM 
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
205
click to vote
COMPGEOM
15 years 11 months ago
1991 ACM
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...
188
click to vote
COMPGEOM
15 years 11 months ago
1991 ACM 
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
175
Voted
COMPGEOM
15 years 11 months ago
1991 ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
|
Discrete Geometry