An output sensitive algorithm for computing visibility graphs
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[2] M. H. Overmars. Construction of sparse visibility graphs , 1987 .
[3] Leonidas J. Guibas,et al. A new representation for linear lists , 1977, STOC '77.
[4] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[5] John Hershberger,et al. Finding the visibility graph of a simple polygon in time proportional to its size , 1987, SCG '87.
[6] Emo WELZL,et al. Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..
[7] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.
[8] Kurt Mehlhorn,et al. A new data structure for representing sorted lists , 1980, Acta Informatica.
[9] Leonidas J. Guibas,et al. Linear time algorithms for visibility and shortest path problems inside simple polygons , 2011, SCG '86.