Euclidean Shortest Paths : Exact or Approximate Algorithms

Overview of attention for book

Cover of 'Euclidean Shortest Paths : Exact or Approximate Algorithms'

Table of Contents

Attention for Chapter 5: Partitioning a Polygon or the Plane

Altmetric Badge

Citations

dimensions_citation: 34 Dimensions

Readers on

mendeley: 1 Mendeley

Summary Dimensions citations

So far, Dimensions has found 34 publications that cite this research output.

34

The most recent citing publications are shown below. View all 34 publications that cite this research output on Dimensions.

Shortest Paths in Graphs of Convex Sets

Article in SIAM Journal on Optimization (February 2024)

Reduced Area Search (RAS): An Algorithm to optimize path planning of Mobile Robots

Conference proceeding (November 2023)

Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones

Preprint in Research Square (October 2023)

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.