Skip to main content

Shortest Paths and Fast Marching Methods

  • 2215 Accesses

Part of the Monographs in Computer Science book series (MCS)

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   84.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Bronstein .

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Bronstein, A., Bronstein, M., Kimmel, R. (2008). Shortest Paths and Fast Marching Methods. In: Numerical Geometry of Non-Rigid Shapes. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-73301-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-73301-2_4

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-73300-5

  • Online ISBN: 978-0-387-73301-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics