Moving Network Voronoi Diagram
暂无分享,去创建一个
[1] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[2] M. Erwig. The graph Voronoi diagram with applications , 2000 .
[3] Sang Won Bae,et al. Optimal Construction of the City Voronoi Diagram , 2006, ISAAC.
[4] Olivier Devillers,et al. Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems , 1993, Int. J. Comput. Geom. Appl..
[5] Leonidas J. Guibas,et al. Linear time algorithms for visibility and shortest path problems inside simple polygons , 2011, SCG '86.
[6] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[7] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[8] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.
[9] Cyrus Shahabi,et al. Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases , 2005, STDBM.
[10] Martine Labbé,et al. The Voronoi Partition of a Network and Its Implications in Location Theory , 1992, INFORMS J. Comput..
[11] Micha Sharir,et al. On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm , 1991, SIAM J. Comput..
[12] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[13] Atsuyuki Okabe,et al. Generalized network Voronoi diagrams: Concepts, computational methods, and applications , 2008, Int. J. Geogr. Inf. Sci..