Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance

DOI10.1007/978-3-540-69733-6_35zbMath1148.68548arXiv0705.2835OpenAlexW2169503673MaRDI QIDQ3511346

Kevin Buchin, Binhai Zhu, Sergey Bereg, Maike Buchin, Marina L. Gavrilova

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Voronoi diagrams and arrangements
• Almost tight upper bounds for lower envelopes in higher dimensions
• Computing Envelopes in Four Dimensions with Applications
• Approximate nearest neighbor algorithms for Frechet distance via product metrics
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES