References
- Asano , T. , Guibas , L. , Hershberger , J. and Imai , H. 1986 . Visibility of disjoint polygons. . Algorithmica , 1 : 49 – 63 .
- Becker , B. , Kriegel , H. , Schneider , R. and Seeger , B. 1990 . “ The R*‐tree: an efficient and robust access method. ” . In 9th ACM SIGMOD International Conference on Management of Data 322 – 331 . Atlantic City, NY, 23–25 May (ACM Press)
- Bially , T. 1969 . Space‐filling curves: their generation and their application to bandwidth reduction. . IEEE Transactions on Information Theory , 15 : 658 – 664 .
- Brinkhoff , T. , Kriegel , H. and Seeger , B. 1993 . “ Efficient processing of spatial joins using R‐trees. ” . In 12th ACM SIGMOD International Conference on Management of Data 237 – 246 . Washington, DC, 26–28 May (ACM Press)
- Corral , A. , Manolopoulos , Y. , Theodoridis , Y. and Vassilakopoulos , M. 2000 . “ Closest pair queries in spatial databases. ” . In 9th ACM SIGMOD International Conference on Management of Data 189 – 200 . Dallas, TX, 16–18 May (ACM Press)
- De BERG , M. , van Kreveld , M. , Overmars , M. and Schwarzkopf , O. 1997 . Computational Geometry , 305 – 315 . Berlin : Springer .
- Dijkstra , E. 1959 . A note on two problems in connection with graphs. . Numerische Mathematik , 1 : 269 – 271 .
- Estivill‐Castro , V. and Lee , I. 2001 . “ Fast spatial clustering with different metrics in the presence of obstacles. ” . In 9th ACM International Symposium on Advances in Geographic Information Systems 142 – 147 . Atlanta, GA, 9–10 November (ACM Press)
- Ghosh , S. and Mount , D. 1987 . An output sensitive algorithm for computing visibility graphs. . IEEE Foundations of Computer Science ,
- Guttman , A. 1984 . “ R‐trees: A dynamic index structure for spatial searching. ” . In 3rd ACM SIGMOD International Conference on Management of Data 47 – 57 . Boston, MA, 18–21 June (ACM Press)
- Hjaltason , G. and Samet , H. 1999 . Distance browsing in spatial databases. . ACM Transactions on Database Systems , 24 : 265 – 318 .
- Kung , R. , Hanson , E. , Ioannidis , Y. , Sellis , T. , Shapiro , L. and Stonebraker , M. 1986 . “ Heuristic search in data base systems. ” . In 1st International Conference on Expert Database Systems 537 – 548 . Kiawah island, SC (Benjamin‐Cummings Publishing)
- Lozano‐Pérez , T. and Wesley , M. 1979 . An algorithm for planning collision‐free paths among polyhedral obstacles. . Communication of ACM , 22 : 560 – 570 .
- Papadias , D. , Zhang , J. , Mamoulis , N. and Tao , Y. 2003 . “ Query processing in spatial network databases. ” . In 29th International Conference on Very Large Data Bases 790 – 801 . Berlin, Germany, 9–12 September (Morgan Kaufmann)
- Pocchiola , M. and Vegter , G. 1995 . Minimal tangent visibility graph. . Computational Geometry: Theory and Applications , 6 : 303 – 314 .
- Pocchiola , M. and Vegter , G. 1996 . Topologically sweeping visibility complexes via pseudo‐triangulations. . Discrete Computational Geometry , 16 : 419 – 453 .
- Rivière , S. 1995 . “ Topologically sweeping the visibility complex of polygonal scenes. ” . In 11th Annual ACM Symposium on Computational Geometry 436 – 437 . Vancouver, British Columsia, 5–7 June (ACM Press)
- Sellis , T. , Roussopoulos , N. and Faloutsos , C. 1987 . “ The R+‐tree: a dynamic index for multi‐dimensional objects. ” . In 13th International Conference on Very Large Data Bases 507 – 518 . Brighton, UK, 1–4 September (Morgan Kaufmann)
- Sharir , M. and Schorr , A. 1984 . “ On shortest paths in polyhedral spaces. ” . In 16th Annual ACM Symposium on Theory of Computing
- Tung , A. , Hou , J. and Han , J. 2001 . “ Spatial clustering in the presence of obstacles. ” . In 17th International Conference on Data Engineering 359 – 367 . Heidelberg, Germany, 2–6 April (IEEE Computer Society)
- Welzl , E. 1985 . Constructing the visibility graph for n line segments in O(n 2) time. . Information Processing Letter , 20 : 167 – 171 .
- Penn State University Libraries, Available online at: http://www.maproom.psu.edu/dcw (accessed 14 October 2005)