4536 search results - page 618 / 908 » Contention-Sensitive Data Structures and Algorithms |
187
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
149
click to vote
GRAPHICSINTERFACE
2003
15 years 8 months ago
2003
Collision detection is a vital task in almost all forms of computer animation and physical simulation. It is also one of the most computationally expensive, and therefore a freque...
154
click to vote
GRAPHICSINTERFACE
2003
15 years 8 months ago
2003
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is eq...
183
click to vote
IWMMDBMS
1996
15 years 8 months ago
1996
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
179
click to vote
CGF
2008
15 years 6 months ago
2008
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...