102291 search results - page 311 / 20459 » Computability in Computational Geometry |
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...
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...
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...
150
click to vote
MFCS
1994
Springer
15 years 10 months ago
1994
Springer
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
199
click to vote
SIGGRAPH
1997
ACM
15 years 11 months ago
1997
ACM
Morse theory shows how the topology of an implicit surface is affected by its function’s critical points, whereas catastrophe theory shows how these critical points behave as th...