NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
Non-Photorealistic Rendering
Fast primitive distribution for illustration
EGRW '02 Proceedings of the 13th Eurographics workshop on Rendering
IBM Journal of Research and Development
Proceedings of the 4th international symposium on Non-photorealistic animation and rendering
Image-guided maze construction
ACM SIGGRAPH 2007 papers
On the History of the Minimum Spanning Tree Problem
IEEE Annals of the History of Computing
The Visual Computer: International Journal of Computer Graphics
Asymptotically optimal block quantization
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We propose a method for generating halftone images by using minimum spanning trees (MSTs). We generate a stippling from an input image by using centroidal Voronoi tessellation (CVT), and then connect all the points in the stippling with an MST. We derive a relationship of darkness between the input image and the MST halftone image by approximating CVT with the hexagonal lattice, and utilize it for correcting the brightness of the MST halftone images. We also propose methods for generating maze-like images on the basis of the MST halftone images. We embed user-specified solution paths in the MST halftone images in two ways. Experimental results show that the solution paths are successfully embedded and hidden in the maze-like images.