Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data
IEEE Transactions on Visualization and Computer Graphics
Image Reconstruction Using Data-Dependent Triangulation
IEEE Computer Graphics and Applications
Combining Region Splitting and Edge Detection through Guided Delaunay Image Subdivision
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Image Coding using Irregular Subsampling and Delaunay Triangulation
SIBGRAPHI '98 Proceedings of the International Symposium on Computer Graphics, Image Processing, and Vision
SVG rendering of real images using data dependent triangulation
Proceedings of the 20th spring conference on Computer graphics
Image compression by linear splines over adaptive triangulations
Signal Processing
Vectorized image segmentation via trixel agglomeration
Pattern Recognition
Towards PDE-Based image compression
VLSM'05 Proceedings of the Third international conference on Variational, Geometric, and Level Set Methods in Computer Vision
| Hi-index | 0.00 |
Representation of the digital image by a triangulation does not bring a high compression but enables geometric transformations and is very simple. In this paper we will show that it is also possible to choose the triangulation vertices randomly, then their [x, y] position does not need to be stored as it can be easily reconstructed during decoding. We show how such a choice behaves in comparison and in combination with the vertices selected from the edges of the digital image.