Sciweavers

3 search results - page 1 / 1
» Scalable shortest paths browsing on land surface
Sort
View
70
Voted
GIS
2010
ACM
14 years 9 months ago
Scalable shortest paths browsing on land surface
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
Songhua Xing, Cyrus Shahabi
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
14 years 10 months ago
Scalable network distance browsing in spatial databases
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
Hanan Samet, Jagan Sankaranarayanan, Houman Alborz...
PVLDB
2008
154views more  PVLDB 2008»
14 years 10 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing