3025 search results - page 265 / 605 » Computational geometry: a retrospective |
200
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
175
click to vote
VIS
2004
IEEE
16 years 8 months ago
2004
IEEE
We address the texture level-of-detail problem for extremely large surfaces such as terrain during realtime, view-dependent rendering. A novel texture hierarchy is introduced base...
166
click to vote
COMPGEOM
2003
ACM
15 years 12 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
169
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
230
click to vote
GRAPHITE
2007
ACM
15 years 10 months ago
2007
ACM
Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in...