108 search results - page 2 / 22 » Constant-Work-Space Algorithm for a Shortest Path in a Simpl... |
LATIN
1998
Springer
13 years 10 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...
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...
COMGEO
2006
ACM
13 years 5 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
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)...