Name
Abstract | ||
|---|---|---|
Image triangulation aims to generate an optimal partition with triangular elements to represent the given image. One bottleneck in ensuring approximation quality between the original image and a piecewise approximation over the triangulation is the inaccurate alignment of straight edges to the curved features. In this paper, we propose a novel variational method called curved optimal triangulation, where not all edges are straight segments, but may also be quadratic Bezier curves. The energy function is defined as the total approximation error determined by vertex locations, connectivity and bending of edges. The gradient formulas of this function are derived explicitly in closed form to optimize the energy function efficiently. We test our method on several models to demonstrate its efficacy and ability in preserving features. We also explore its applications in the automatic generation of stylization and Lowpoly images. With the same number of vertices, our curved optimal triangulation method generates more accurate and visually pleasing results compared with previous methods that only use straight segments. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1111/cgf.14495 | COMPUTER GRAPHICS FORUM |
Keywords | DocType | Volume |
image processing, mesh generation, modelling, curves & surfaces | Journal | 41 |
Issue | ISSN | Citations |
6 | 0167-7055 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanyang Xiao | 1 | 0 | 0.34 |
| Juan Cao | 2 | 38 | 7.92 |
| Zhonggui Chen | 3 | 78 | 8.93 |