Name
Abstract | ||
|---|---|---|
In this paper we survey some results in restricted orientation computational geometry. The aim is to embed our own results into a more general context. We discuss methods for making object queries, computing shortest paths, and questions on restricted orientation convexity. Furthermore, we give an optimal algorithm for computing shortest paths when three arbitrary orientations are allowed for path links and obstacle edges. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1007/3-540-55488-2_26 | Data Structures and Efficient Algorithms |
Keywords | Field | DocType |
restricted orientation computational geometry,computational geometry,shortest path | Sum of radicals,Mathematical optimization,Convex geometry,Shortest path problem,Computer science,Computational geometry,Algorithm,Shortest Path Faster Algorithm,Computational topology,K shortest path routing,Euclidean shortest path | Conference |
Volume | ISSN | ISBN |
594 | 0302-9743 | 3-540-55488-2 |
Citations | PageRank | References |
1 | 0.36 | 34 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bengt J. Nilsson | 1 | 210 | 24.43 |
| Thomas Ottmann | 2 | 124 | 39.28 |
| Sven Schuierer | 3 | 308 | 29.35 |
| Christian Icking | 4 | 364 | 33.17 |