195 search results - page 10 / 39 » Simultaneous Surface Approximation and Segmentation of Compl... |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In background subtraction, cast shadows induce silhouette distortions and object fusions hindering performance of high level algorithms in scene monitoring. We introduce a nonpara...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
A method for detecting and segmenting periodic motion is presented. We exploit periodicity as a cue and detect periodic motion in complex scenes where common methods for motion se...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface E...
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...