Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Geographic, Information Science - 4th International Conference, GIScience 2006, Proceedings |
| Herausgeber (Verlag) | Springer Verlag |
| Seiten | 65-80 |
| Seitenumfang | 16 |
| ISBN (Print) | 3540445269, 9783540445265 |
| Publikationsstatus | Veröffentlicht - Sept. 2006 |
| Veranstaltung | 4th International Conference on Geographic, Information Science, GIScience 2006 - Munster, Deutschland Dauer: 20 Sept. 2006 → 23 Sept. 2006 |
Publikationsreihe
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Band | 4197 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (elektronisch) | 1611-3349 |
Abstract
In this paper we present an approach to providing landmark-based routes using a shortest-path algorithm. We start from the assumption, that at one junction there can be several landmarks to choose among, in order to find an optimal description of a route. The landmark selection used for describing the route is optimized taking the quality measures for the landmarks into account. Therefore, it is necessary to define quality measures. In the paper different types of quality measures are introduced and their integration in the route graph, as well as in a routing algorithm is presented. The usability of the approach is demonstrated using test data.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Informatik (insg.)
- Allgemeine Computerwissenschaft
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Geographic, Information Science - 4th International Conference, GIScience 2006, Proceedings. Springer Verlag, 2006. S. 65-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 4197 LNCS).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Incorporating landmarks with quality measures in routing procedures
AU - Elias, Birgit
AU - Sester, Monika
PY - 2006/9
Y1 - 2006/9
N2 - In this paper we present an approach to providing landmark-based routes using a shortest-path algorithm. We start from the assumption, that at one junction there can be several landmarks to choose among, in order to find an optimal description of a route. The landmark selection used for describing the route is optimized taking the quality measures for the landmarks into account. Therefore, it is necessary to define quality measures. In the paper different types of quality measures are introduced and their integration in the route graph, as well as in a routing algorithm is presented. The usability of the approach is demonstrated using test data.
AB - In this paper we present an approach to providing landmark-based routes using a shortest-path algorithm. We start from the assumption, that at one junction there can be several landmarks to choose among, in order to find an optimal description of a route. The landmark selection used for describing the route is optimized taking the quality measures for the landmarks into account. Therefore, it is necessary to define quality measures. In the paper different types of quality measures are introduced and their integration in the route graph, as well as in a routing algorithm is presented. The usability of the approach is demonstrated using test data.
UR - http://www.scopus.com/inward/record.url?scp=33750262446&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33750262446
SN - 3540445269
SN - 9783540445265
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 65
EP - 80
BT - Geographic, Information Science - 4th International Conference, GIScience 2006, Proceedings
PB - Springer Verlag
T2 - 4th International Conference on Geographic, Information Science, GIScience 2006
Y2 - 20 September 2006 through 23 September 2006
ER -