Skip to main navigation Skip to search Skip to main content

Shortest paths and networks

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

39 Scopus citations

Abstract

Computing an optimal path in a geometric domain is a fundamental problem in computational geometry, with applications in robotics, geographic information systems (GIS), wire routing, etc.

Original languageEnglish
Title of host publicationHandbook of Discrete and Computational Geometry, Third Edition
PublisherCRC Press
Pages811-848
Number of pages38
ISBN (Electronic)9781498711425
ISBN (Print)9781498711395
DOIs
StatePublished - Jan 1 2017

Fingerprint

Dive into the research topics of 'Shortest paths and networks'. Together they form a unique fingerprint.

Cite this