2980 search results - page 254 / 596 » Computational Geometry |
164
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
167
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
158
click to vote
CAD
2004
Springer
15 years 5 months ago
2004
Springer
In recent years, geometry processing algorithms that directly operate on polygonal meshes have become an indispensable tool in computer graphics, CAD/CAM applications, numerical s...
184
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...
149
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
Detection of feature points in images is an important preprocessing stage for many algorithms in Computer Vision. We address the problem of detection of feature points in video se...