Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Computing geodesic paths on manifolds

R Kimmel1, J A Sethian

  • 1Department of Mathematics and Lawrence Berkeley National Laboratory, University of California, Berkeley, CA 94720, USA.

Proceedings of the National Academy of Sciences of the United States of America
|July 22, 1998
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Joint iterative reconstruction and 3D rigid alignment for X-ray tomography.

Optics express·2022
Same author

Numerical study on electrohydrodynamic multiple droplet interactions.

Physical review. E·2020
Same author

Electrohydrodynamic coalescence of droplets using an embedded potential flow model.

Physical review. E·2018
Same author

Augmented Topological Descriptors of Pore Networks for Material Science.

IEEE transactions on visualization and computer graphics·2015
Same author

Numerical simulations of electrostatically driven jets from nonviscous droplets.

Physical review. E, Statistical, nonlinear, and soft matter physics·2014
Same author

Cytotoxic effects of 2-butoxyethanol in vitro are related to butoxyacetaldehyde, an intermediate oxidation product.

Environmental toxicology and pharmacology·2011

The Fast Marching Method now efficiently solves the Eikonal equation on triangulated domains. This numerical algorithm computes geodesic distances and extracts shortest paths with optimal time complexity.

Area of Science:

  • Numerical analysis
  • Computational geometry
  • Differential geometry

Background:

  • The Fast Marching Method is a numerical technique for solving the Eikonal equation.
  • Existing methods are primarily designed for rectangular meshes.
  • Extending these methods to complex domains is computationally challenging.

Purpose of the Study:

  • To extend the Fast Marching Method to triangulated domains.
  • To maintain the algorithm's efficient computational complexity.
  • To develop an optimal time algorithm for geodesic distance computation and shortest path extraction on triangulated manifolds.

Main Methods:

  • Extension of the Fast Marching Method to handle triangulated meshes.
  • Implementation of an algorithm with O(M log M) time complexity, where M is the number of grid points.

Related Experiment Videos

  • Application of the extended method for geodesic distance calculation.

    • Main Results:

    • The Fast Marching Method is successfully adapted for triangulated domains.
    • The extended algorithm achieves the same computational complexity as the original method.
    • An optimal time algorithm for computing geodesic distances and shortest paths on triangulated manifolds is presented.

    Conclusions:

    • The adapted Fast Marching Method provides an efficient solution for the Eikonal equation on triangulated domains.
    • This work enables efficient computation of geodesic distances and shortest paths in complex geometric settings.
    • The findings have implications for various applications requiring shortest path analysis on surfaces.