Sciweavers

203 search results - page 17 / 41
» Incremental computation of planar maps
Sort
View
COMGEO
2006
ACM
14 years 11 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
ICPP
1994
IEEE
15 years 3 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
ECCV
2010
Springer
14 years 12 months ago
Geodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
Julien Rabin, Gabriel Peyré, Laurent D. Coh...
ISBI
2007
IEEE
15 years 6 months ago
Brain Surface Conformal Parameterization with the Ricci Flow
In medical imaging, parameterized 3D surface models are of great interest for anatomical modeling and visualization, statistical comparisons of anatomy, and surface-based registra...
Yalin Wang, Xianfeng Gu, Tony F. Chan, Paul M. Tho...
ICDE
2012
IEEE
202views Database» more  ICDE 2012»
13 years 2 months ago
Recomputing Materialized Instances after Changes to Mappings and Data
—A major challenge faced by today’s information systems is that of evolution as data usage evolves or new data resources become available. Modern organizations sometimes exchan...
Todd J. Green, Zachary G. Ives