55 search results - page 4 / 11 » Paired Pointset Traversal |
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
EOR
2007
13 years 7 months ago
2007
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
SIGMOD
2000
ACM
13 years 11 months ago
2000
ACM
We discovered a surprising law governing the spatial join selectivity across two sets of points. An example of such a spatial join is "find the libraries that are within 10 m...
ICIP
1999
IEEE
14 years 9 months ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...