Återgå till huvudnavigering Återgå till sök Gå direkt till huvudinnehållet

A Novel Algorithm for Computing Riemannian Geodesic Distance in Rectangular 2D Grids

  • Ola Nilsson
  • , Martin Reimers
  • , Ken Museth
  • , Anders Brun

    Publikation: Kapitel i bok/rapport/konferenshandlingKonferensartikel i proceedingsPeer review

    Sammanfattning

    We present a novel way to efficiently compute Riemannian geodesic distance over a two-dimensional domain. It is based on a previ- ously presented method for computation of geodesic distances on surface meshes. Our method is adapted for rectangular grids, equipped with a variable anisotropic metric tensor. Processing and visualization of such tensor fields is common in certain applications, for instance structure ten- sor fields in image analysis and diffusion tensor fields in medical imaging. The included benchmark study shows that our method provides signif- icantly better results in anisotropic regions and is faster than current stat-of-the-art solvers. Additionally, our method is straightforward to code; the test implementation is less than 150 lines of C++ code.
    OriginalspråkEngelska
    Titel på värdpublikationAdvances in Visual Computing: 8th International Symposium, ISVC 2012, Rethymnon, Crete, Greece, July 16-18, 2012, Revised Selected Papers, Part II
    FörlagSpringer Berlin Heidelberg
    Sidor265-274
    Antal sidor10
    ISBN (elektroniskt)978-3-642-33191-6
    ISBN (tryckt)978-3-642-33190-9
    DOI
    StatusPublicerad - 2012

    Publikationsserier

    SerieLecture Notes in Computer Science
    Volym7432
    ISSN0302-9743

    Citera det här