An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles

DOI10.1137/1.9781611974331.ch82zbMath1411.68164arXiv1706.02939OpenAlexW2952476488MaRDI QIDQ4575663

Oren Salzman, Kyle Fox, Pankaj K. Agarwal

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

This page was built for publication: An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles