Link distance and shortest path problems in the plane

A.F. Cook IV, C. Wenk

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)

    Abstract

    We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fréchet distance in the plane with polygonal obstacles. Distances between points are measured either by link distance or by Euclidean shortest path distance.
    Original languageEnglish
    Title of host publicationAlgorithmic aspects in information and management : 5th international conference on algorithmic aspects in information and management (AAIM 2009), 15-17 June 2009 : proceedings
    EditorsA.V. Goldberg, Y. Zhou
    Place of PublicationBerlin
    PublisherSpringer
    Pages141-151
    ISBN (Print)978-3-642-02157-2
    DOIs
    Publication statusPublished - 2009

    Publication series

    NameLecture Notes in Computer Science
    Volume5564
    ISSN (Print)0302-9743

    Fingerprint Dive into the research topics of 'Link distance and shortest path problems in the plane'. Together they form a unique fingerprint.

    Cite this