Sciweavers

1604 search results - page 37 / 321
» Approximation algorithms for developable surfaces
Sort
View
SIGGRAPH
1992
ACM
14 years 27 days ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
WSCG
2004
185views more  WSCG 2004»
13 years 10 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
VMV
2003
154views Visualization» more  VMV 2003»
13 years 10 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 10 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
CVPR
2001
IEEE
14 years 10 months ago
Bending Invariant Representations for Surfaces
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...
Asi Elad (Elbaz), Ron Kimmel