COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
FUN
2010
Springer
13 years 8 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
SSD
1995
Springer
13 years 8 months ago
1995
Springer
We present a data structure used to represent planar spatial databases in the topological data model. Conceptually, such databases consist of points, lines between these points, an...
HPCN
1997
Springer
13 years 8 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
JCDCG
2000
Springer
13 years 8 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
CGI
2003
IEEE
13 years 8 months ago
2003
IEEE
This paper presents a system to analyze the reachability of the human body. The inverse kinematics technique is employed to find which regions of space are reachable using a certa...
ESOP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
EMO
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Archives are used in Multi-Objective Evolutionary Algorithms to establish elitism. Depending on the optimization problem, an unconstrained archive may grow to an immense ...
ECOOP
2006
Springer
13 years 8 months ago
2006
Springer
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...