Skip to Main Content
The interest in content adaptive mesh generation of images has been arising lately due to its wide area of applications in image processing. The major issue is to represent an image with a low number of pixels while preserving its content. These pixels or the nonuniform samples are then used to generate a mesh that approximates the corresponding image. This work presents a novel method based on binary space partitions in combination with three clustering schemes to approximate an image with a mesh. The algorithm has the ability to simultaneously reduce the number of pixels and generate the mesh approximation. The idea is to assume each triangle of the mesh as a plane. Consequently, it will be possible to reconstruct the inlying pixels with planar equations defined from the three nodes of each triangle. If a triangle's equation does not have the ability to reconstruct the pixels lying within up to a predefined error, it is split into two new triangles. Tested on several real images, the proposed method leads to reduced size meshes in a fast manner while retaining the visual quality of the reconstructed images. In addition, it is parallelizable due to the property of binary space partitions which facilitates its application in real-time scenarios.