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

DOI10.1145/3230650zbMath1454.68150OpenAlexW2888446832WikidataQ129400690 ScholiaQ129400690MaRDI QIDQ4629959

Oren Salzman, Kyle Fox, Pankaj K. Agarwal

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3230650

zbMATH Keywords

approximationmotion planningcomputational geometrybicriteria objective

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