Sampling-based bottleneck pathfinding with applications to Fréchet matching

DOI10.4230/LIPICS.ESA.2016.76zbMATH Open1397.68209arXiv1607.02770MaRDI QIDQ4606351FDOQ4606351

Authors: Kiril Solovey, Dan Halperin 

Publication date: 2 March 2018

Full work available at URL: https://arxiv.org/abs/1607.02770

Recommendations

• Bottleneck partial-matching Voronoi diagrams and applications
• Geodesic Fréchet distance inside a simple polygon
• Geodesic Fréchet distance inside a simple polygon
• scientific article; zbMATH DE number 7238975
• Fréchet Distance for Curves, Revisited

zbMATH Keywords

computational geometryrandom geometric graphssampling-based algorithmsbottleneck pathfindingFréchet distances

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (2)

• Title not available (Why is that?)
• Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch

This page was built for publication: Sampling-based bottleneck pathfinding with applications to Fréchet matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606351)