61 search results - page 5 / 13 » Pointed Binary Encompassing Trees |
CCCG
2008
13 years 9 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
IJCV
2008
13 years 7 months ago
2008
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...