1011 search results - page 18 / 203 » The three dimensions of proofs |
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...
MLQ
2008
14 years 9 months ago
2008
We compare two Picard groups in dimension one. Our proofs are constructive and the results generalize a theorem of J. Sands [11]. MSC 2000: 13C15, 13C20, 03F65, 13F45
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
DCG
2010
14 years 9 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...