1888 search results - page 52 / 378 » Algorithms for Querying by Spatial Structure |
131
click to vote
CGF
1999
15 years 4 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
149
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
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...
136
click to vote
CCCG
2008
15 years 5 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
135
click to vote
ICDT
1995
ACM
15 years 8 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
160
click to vote
WISE
2002
Springer
15 years 9 months ago
2002
Springer
The need of using spatial vector data for web-based and mobile applications has been increasing rapidly. Vector spatial data is difficult to generalise (that is, to derive a suita...