Sciweavers

56 search results - page 1 / 12
» Distance-Sensitive Planar Point Location
Sort
View
ISVC
2010
Springer
13 years 3 months ago
Interpolating 3D Diffusion Tensors in 2D Planar Domain by Locating Degenerate Lines
Interpolating diffusion tensor fields is a key technique to visualize the continuous behaviors of biological tissues such as nerves and muscle fibers. However, this has been stil...
Chongke Bi, Shigeo Takahashi, Issei Fujishiro
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 6 months ago
Distribution-sensitive point location in convex subdivisions
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
Sébastien Collette, Vida Dujmovic, John Iac...
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 4 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
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 6 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
13 years 6 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount