1604 search results - page 3 / 321 » Approximation algorithms for developable surfaces |
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...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
IMR
2004
Springer
14 years 27 days ago
2004
Springer
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection o...
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
Caustics are important visual phenomena, as well as challenging global illumination effects in computer graphics. Physically caustics can be interpreted from one of two perspectiv...