11211 search results - page 39 / 2243 » Data Structures |
164
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
ESA
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
PODC
2003
ACM
15 years 3 months ago
2003
ACM
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocki...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
ICPR
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...