450 search results - page 57 / 90 » Quadrangulations of Planar Sets |
RT
2001
Springer
14 years 1 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
VVS
1998
IEEE
14 years 1 months ago
1998
IEEE
The process of generating discrete surfaces in a volumetric representation, termed voxelization, is confronted with topological considerations as well as accuracy and efficiency r...
FGR
1996
IEEE
14 years 1 months ago
1996
IEEE
We extend the work of Black and Yacoob on the tracking and recognition of human facial expressions using parameterized models of optical flow to deal with the articulatedmotion of...
STOC
1993
ACM
14 years 1 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
SWAT
1990
Springer
14 years 1 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...