1604 search results - page 38 / 321 » Approximation algorithms for developable surfaces |
IMR
2004
Springer
14 years 2 months ago
2004
Springer
A surface is often approximated by a network of triangular facets. In the absence of a precise mathematical description of the underlying surface all information about surface pro...
VRST
1997
ACM
14 years 1 months ago
1997
ACM
Intuitive 3D surface control and deformation are crucial to CAD/CAM. To do this in a virtual environment, however, the technique must be very efficient. A common method for shape ...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
ICMCS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...