Trekking in the Alps without freezing or getting tired

M. Berg, de, M.J. Kreveld, van

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    58 Citaten (Scopus)
    8 Downloads (Pure)

    Samenvatting

    Let F be a polyhedral terrain with n vertices. We show how to preprocess F such that for any two query points on F it can be decided whether there exists a path on F between the two points whose height decreases monotonically. More generally, the minimum total ascent or descent along any path between the two points can be computed. It is also possible to decide, given two query points and a height, whether there is a path that stays below this height. All these queries can be answered with one data structure which stores the so-called height-level map of the terrain. Although the height-level map has quadratic worst-case complexity, it is stored implicitly using only linear storage. The query time for all the above queries is and the structure can be built in time. A path with the desired property can be reported in additional time that is linear in the description size of the path.
    Originele taal-2Engels
    Pagina's (van-tot)306-323
    Aantal pagina's18
    TijdschriftAlgorithmica
    Volume18
    Nummer van het tijdschrift3
    DOI's
    StatusGepubliceerd - 1997

    Vingerafdruk Duik in de onderzoeksthema's van 'Trekking in the Alps without freezing or getting tired'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit