Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMPGEOM
1991
ACM
12 years 1 months ago
The Two Guards Problem
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...
Christian Icking, Rolf Klein
COMPGEOM
1991
ACM
12 years 1 months ago
Polynomial-Size Nonobtuse Triangulation of Polygons
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...
Marshall W. Bern, David Eppstein
COMPGEOM
1991
ACM
12 years 1 months ago
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
We present a new pivot-based algorithm which can be used with minor modiļ¬cation for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
David Avis, Komei Fukuda
COMPGEOM
1991
ACM
12 years 1 months ago
Crossing Families
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...
Boris Aronov, Paul Erdös, Wayne Goddard, Dani...
COMPGEOM
1991
ACM
12 years 1 months ago
Arrangements of Segments that Share Endpoints: Single Face Results
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...
Esther M. Arkin, Dan Halperin, Klara Kedem, Joseph...
books