Sciweavers

52 search results - page 4 / 11
» Improved Deletions in Dynamic Spatial Approximation Trees
Sort
View
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 7 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
TKDE
1998
122views more  TKDE 1998»
13 years 7 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
JEA
2008
97views more  JEA 2008»
13 years 8 months ago
Approximating the true evolutionary distance between two genomes
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
Krister M. Swenson, Mark Marron, Joel V. Earnest-D...
SMI
2005
IEEE
140views Image Analysis» more  SMI 2005»
14 years 1 months ago
Interactive Implicit Modeling with Hierarchical Spatial Caching
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...
Ryan Schmidt, Brian Wyvill, Eric Galin
VLDB
2000
ACM
136views Database» more  VLDB 2000»
13 years 11 months ago
Managing Intervals Efficiently in Object-Relational Databases
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl