Accurate polygon scan conversion using half-open intervals
Graphics Gems III
Surface approximation and geometric partitions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Image Reconstruction Using Data-Dependent Triangulation
IEEE Computer Graphics and Applications
Adaptive thinning for bivariate scattered data
Journal of Computational and Applied Mathematics
Image Coding using Irregular Subsampling and Delaunay Triangulation
SIBGRAPHI '98 Proceedings of the International Symposium on Computer Graphics, Image Processing, and Vision
Nonuniform image reconstruction using multilevel surface interpolation
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Image compression by linear splines over adaptive triangulations
Signal Processing
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Preferred directions for resolving the non-uniqueness of Delaunay triangulations
Computational Geometry: Theory and Applications
Texture recognition from sparsely and irregularly sampled data
Computer Vision and Image Understanding
Content adaptive mesh representation of images using binary space partitions
IEEE Transactions on Image Processing
Fractal image compression based on Delaunay triangulation and vector quantization
IEEE Transactions on Image Processing
The farthest point strategy for progressive image sampling
IEEE Transactions on Image Processing
A fast approach for accurate content-adaptive mesh generation
IEEE Transactions on Image Processing
IEEE Transactions on Circuits and Systems for Video Technology
A Flexible Content-Adaptive Mesh-Generation Strategy for Image Representation
IEEE Transactions on Image Processing
Hi-index | 0.08 |
A flexible mesh-generation framework for image representation based on Delaunay triangulations is proposed. By fixing the various degrees of freedom available within this framework, two mesh-generation methods, known as ID1 and ID2, are derived. These two methods are shown to perform extremely well, producing meshes of significantly higher quality than state-of-the-art schemes at relatively low computational cost. Furthermore, the ID1 and ID2 methods each provide a mechanism whereby mesh quality can be increased (or decreased) in return for a corresponding increase (or decrease) in computational cost. Lastly, we demonstrate that one component of our proposed methods, called bad-point replacement, can be used as a postprocessing optimization step that, when added to other previously-proposed mesh-generation methods, yields meshes of much greater quality.