Author:
Bae Sang Won,Korman Matias,Okamoto Yoshio
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference21 articles.
1. Agarwal, P.K., Aronov, B., O’Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM J. Comput. 26(6), 1689–1713 (1997)
2. Aronov, B., Fortune, S., Wilfong, G.: The furthest-site geodesic Voronoi diagram. Discrete Comput. Geom. 9, 217–255 (1993)
3. Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University, Montreal (1985)
4. Bae, S.W., Chwa, K.-Y.: The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. In: Proceedings of 25th Annual Symposium Computational Geometry (SoCG), pp. 198–207 (2009)
5. Bae, S.W., Okamoto, Y.: Querying two boundary points for shortest paths in a polygonal domain. Comput. Geom. 45(7), 284–293 (2012)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献