Sciweavers

COMPGEOM
1991
ACM
14 years 3 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
ISAAC
1993
Springer
87views Algorithms» more  ISAAC 1993»
14 years 3 months ago
Finding the Shortest Watchman Route in a Simple Polygon
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
Svante Carlsson, Håkan Jonsson, Bengt J. Nil...
GD
1994
Springer
14 years 3 months ago
Visibility Graphs and Oriented Matroids
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...
James Abello, Krishna Kumar
LATIN
1998
Springer
14 years 3 months ago
Short and Smooth Polygonal Paths
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
James Abello, Emden R. Gansner
IROS
2006
IEEE
106views Robotics» more  IROS 2006»
14 years 5 months ago
Where to Build a Door
— A room is a simple polygon with a prespecified point, called the door, on its boundary. Search starts at the door, and must detect any intruder that may be in the room, while ...
John Z. Zhang, Tsunehiko Kameda
CAIP
2007
Springer
132views Image Analysis» more  CAIP 2007»
14 years 5 months ago
Decomposing a Simple Polygon into Trapezoids
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon)...
Fajie Li, Reinhard Klette