COMPGEOM
1991
ACM
13 years 9 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...
ISAAC
1993
Springer
13 years 9 months ago
1993
Springer
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...
GD
1994
Springer
13 years 9 months ago
1994
Springer
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 ...
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
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...
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— 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 ...
CAIP
2007
Springer
13 years 11 months ago
2007
Springer
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)...