55 search results - page 1 / 11 » Paired Pointset Traversal |
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
160
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
We identify and formalize a novel join operator for two spatial pointsets P and Q. The common influence join (CIJ) returns the pairs of points (p, q), p P, q Q, such that there e...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
CCCG
2008
14 years 11 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
134
click to vote
DCC
2011
IEEE
14 years 4 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...