7006 search results - page 1012 / 1402 » Approximation Algorithms |
162
click to vote
IWVF
2001
Springer
15 years 11 months ago
2001
Springer
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
180
click to vote
RT
2001
Springer
15 years 11 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...
156
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
139
click to vote
DCC
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a simple and e ective post-processing method for compressed images. This work focuses on the cyclic time-variance introduced by block-based and subband transfo...
189
click to vote
SMI
1999
IEEE
15 years 11 months ago
1999
IEEE
Inspection of reflection line patterns is a standard way to check the quality of free form surfaces. In this paper, we describe an approach which enables the designer to control d...