2011

Euclidean Shortest Paths

Exact or Approximate Algorithms

Authors:

ISBN: 978-1-4471-2255-5 (Print) 978-1-4471-2256-2 (Online)

Table of contents (12 chapters)

  1. Front Matter

    Pages I-XVII

  2. Discrete or Continuous Shortest Paths

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-29

      Euclidean Shortest Paths

    3. No Access

      Book Chapter

      Pages 31-51

      Deltas and Epsilons

    4. No Access

      Book Chapter

      Pages 53-89

      Rubberband Algorithms

  3. Paths in the Plane

    1. Front Matter

      Pages 91-91

    2. No Access

      Book Chapter

      Pages 93-125

      Convex Hulls in the Plane

    3. No Access

      Book Chapter

      Pages 127-169

      Partitioning a Polygon or the Plane

    4. No Access

      Book Chapter

      Pages 171-187

      ESPs in Simple Polygons

  4. Paths in 3-Dimensional Space

    1. Front Matter

      Pages 189-189

    2. No Access

      Book Chapter

      Pages 191-211

      Paths on Surfaces

    3. No Access

      Book Chapter

      Pages 213-230

      Paths in Simple Polyhedrons

    4. No Access

      Book Chapter

      Pages 231-309

      Paths in Cube-Curves

  5. Art Galleries

    1. Front Matter

      Pages 311-311

    2. No Access

      Book Chapter

      Pages 313-325

      Touring Polygons

    3. No Access

      Book Chapter

      Pages 327-345

      Watchman Routes

    4. No Access

      Book Chapter

      Pages 347-361

      Safari and Zookeeper Problems

  6. Back Matter

    Pages 363-376