Similarity metrics are functions that measure the similarity of geometric objects. The motivation for studying similarity metrics is that these functions are essential building blocks for areas such as computer vision, robotics, medical imaging, and drug design. Although similarity metrics are traditionally computed in environments without obstacles, we use shortest paths to compute similarity metrics in simple polygons, in polygons with polygonal holes, and on polyhedral surfaces. We measure the length of a path either by Euclidean distance or by the number of turns on the path. We also compute shortest paths that steer a medical needle through a sequence of treatment points in the plane. This technique could be used in biopsy procedures to take multiple tissue samples with a single puncture of the skin. Such an algorithm could also be applied to brachytherapy procedures that implant radioactive pellets at many cancerous locations. Computing shortest paths for medical needles is a challenging problem because medical needles cut through tissue along circular arcs and have a limited ability to turn. Although optimal substructure can fail, we compute globally optimal paths with a wavefront propagation technique.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Obstacle-avoiding similarity metrics and shortest-path problems


    Beteiligte:
    Cook IV, A.F. (Autor:in)

    Erscheinungsdatum :

    01.01.2009


    Anmerkungen:

    Cook IV , A F 2009 , ' Obstacle-avoiding similarity metrics and shortest-path problems ' , Doctor of Philosophy , University of Texas at San Antonio , San Antonio .


    Medientyp :

    Hochschulschrift


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Klassifikation :

    DDC:    629



    Method and Apparatus for Planning Obstacle Avoiding Path

    Europäisches Patentamt | 2020

    Freier Zugriff

    Method and Apparatus for Planning Obstacle Avoiding Path

    PARK TAE HYOUNG / HEO SUNG WOO | Europäisches Patentamt | 2019

    Freier Zugriff

    AutoDrone: Shortest Optimized Obstacle-Free Path Planning for Autonomous Drones

    Jana, Prithwish / Jana, Debasish | ArXiv | 2021

    Freier Zugriff

    Real-Time Obstacle-Avoiding Path Planning for Mobile Robots

    Choi, Ji-Wung / Curry, Renwick / Elkaim, Gabriel | AIAA | 2010


    Real-Time Obstacle Avoiding Path Planning for Mobile Robots

    Choi, J.-W. / Curry, R. / Elkaim, G. et al. | British Library Conference Proceedings | 2010