1330 search results - page 1 / 266 » Dynamic Data Structures for Fat Objects and Their Applicatio... |
WADS
1997
Springer
13 years 10 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
ESA
2006
Springer
13 years 10 months ago
2006
Springer
We design compact and responsive kinetic data structures for detecting collisions between n convex fat objects in 3-dimensional space that can have arbitrary sizes. Our main result...
ALGORITHMICA
2000
13 years 6 months ago
2000
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
CCCG
2008
13 years 7 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
SODA
1998
ACM
13 years 7 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...