387 search results - page 48 / 78 » Towards in-place geometric algorithms and data structures |
151
Voted
WADS
2007
Springer
15 years 6 months 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 ε >...
109
Voted
COMPGEOM
2004
ACM
15 years 5 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...
91
Voted
IJON
2008
15 years 14 days 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...
VISUALIZATION
2002
IEEE
15 years 5 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...
83
Voted
VRCAI
2006
ACM
15 years 6 months 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...