Region-based approximation algorithms for visibility between imprecise locations
Tipo de documentoTexto en actas de congreso
Fecha de publicación2015
Condiciones de accesoAcceso restringido por política de la editorial
In this paper we present new geometric algorithms for approximating the visibility between two imprecise locations amidst a set of obstacles, where the imprecise locations are modeled by continuous probability distributions. Our techniques are based on approximating distributions by a set of regions rather than on approximating by a discrete point sample. In this way we obtain guaranteed error bounds, and the results are more robust than similar results based on discrete point sets. We implemented our techniques and present an experimental evaluation. The experiments show that the actual error of our region-based approximation scheme converges quickly when increasing the complexity of the regions.
CitaciónBuchin, K., Kostitsyna, I., Löffler, M., Silveira, R.I. Region-based approximation algorithms for visibility between imprecise locations. A: Workshop on Algorithm Engineering and Experiments. "Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments". 2015, p. 94-103.
Versión del editorhttp://epubs.siam.org/doi/abs/10.1137/1.9781611973754.9