A general approximation algorithm for planar maps with applications
Given an unknown target planar map, we present an algorithm for constructing an approximation of the unknown target based on information gathered from linear probes of the target. Our algorithm is a general purpose reconstruction algorithm that can be applied in many settings. Our algorithm is particularly suited for the setting where computing the intersection of a line with an unknown target is much simpler than computing the unknown target itself. The algorithm maintains a triangulation from which the approximation of the unknown target can be extracted. We evaluate the quality of the approximation with respect to the target both in the topological sense and the metric sense. The correctness of the algorithm and the evaluation of its time complexity are also presented. Finally, we present some experimental results. For example, since generalized Voronoi diagrams are planar maps, our algorithm presents a simpler alternative method for constructing approximations of generalized Voronoi diagrams, which are notoriously difficult to compute.
|Keywords||Approximation, Generalized Voronoi diagram, Integral geometry, Planar map, Random line|
|Journal||International Journal of Computational Geometry and Applications|
Bose, P, Coll, N. (Narcís), Hurtado, F. (Ferran), & Sellarès, J.A. (J. Antoni). (2007). A general approximation algorithm for planar maps with applications. International Journal of Computational Geometry and Applications, 17(6), 529–554. doi:10.1142/S0218195907002471