83 search results - page 6 / 17 » Deflating polygons to the limit |
GMP
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we present a method for constructing Loop’s subdivision surface patches with given G1 boundary conditions and a given topology of control polygon of the subdivisi...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the ...
IJCGA
2010
14 years 8 months ago
2010
Imagine you are trapped in a maze of caves. All you have is an old rusty compass and barely enough light to read it. How much inaccuracy can you allow to ensure that you can leave...
MM
2005
ACM
15 years 3 months ago
2005
ACM
Most work in human activity recognition is limited to relatively simple behaviors like sitting down, standing up or other dramatic posture changes. Very little has been achieved i...
106
click to vote
GRAPHICSINTERFACE
2000
14 years 11 months ago
2000
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplifica...