Sciweavers

8 search results - page 2 / 2
» alenex 2004
Sort
View
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 6 months ago
Approximating the Visible Region of a Point on a Terrain
Given a terrain T and a point p on or above it, we wish to compute the region Rp that is visible from p. We present a generic radar-like algorithm for computing an approximation o...
Boaz Ben-Moshe, Paz Carmi, Matthew J. Katz
ALENEX
2004
107views Algorithms» more  ALENEX 2004»
13 years 6 months ago
An Experimental Analysis of a Compact Graph Representation
In previous work we described a method for compactly representing graphs with small separators, which makes use of small separators, and presented preliminary experimental results...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
ALENEX
2004
121views Algorithms» more  ALENEX 2004»
13 years 6 months ago
Experimental Comparison of Shortest Path Approaches for Timetable Information
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Ch...