Efficient Construction of Low Complexity Geodesic Spanners in Polygonal Domains
The authors present efficient algorithms to construct low complexity geodesic spanners for a set of n point sites in a polygonal domain with m vertices. They introduce the novel spanner property of complexity, which is the total complexity of all edges in the spanner, and provide trade-offs between the spanning ratio and the spanner complexity.