387 search results - page 48 / 78 » Towards in-place geometric algorithms and data structures |
211
click to vote
WADS
2007
Springer
16 years 8 days ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
163
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
151
click to vote
IJON
2008
15 years 6 months ago
2008
In many computer vision tasks like face recognition and image retrieval, one is often confronted with high-dimensional data. Procedures that are analytically or computationally ma...
144
click to vote
VISUALIZATION
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a method for interactive rendering of large outdoor scenes. Complex polygonal plant models and whole plant populations are represented by relatively small sets of point...
144
click to vote
VRCAI
2006
ACM
16 years 3 days ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...