387 search results - page 55 / 78 » Towards in-place geometric algorithms and data structures |
143
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
Surface elements (surfels) are a powerful paradigm to efficiently render complex geometric objects at interactive frame rates. Unlike classical surface discretizations, i.e., tri...
100
Voted
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
88
Voted
CEAS
2007
Springer
15 years 6 months ago
2007
Springer
Email has become an integral and sometimes overwhelming part of users’ personal and professional lives. In this paper, we measure the flow and frequency of user email toward th...
109
Voted
VIS
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...