2019
DOI: 10.1016/j.cagd.2019.101769
|View full text |Cite
|
Sign up to set email alerts
|

Colour interpolants for polygonal gradient meshes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
5
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 25 publications
0
5
0
1
Order By: Relevance
“…Beatson et al [10] then extended the domain to piecewise quadratic boundaries, where they proposed the Hermite mean value interpolation technique for polygons. Hettinga et al [53] further adjusted the interpolation schemes from generalized Bézier patches [125] and Charrot-Gregory corner interpolation patches [22] (both are multi-sided parametric patches) such that the interpolation scheme can be used for 2D gradient meshes. By using the algorithm from Chiyokura and Kimura [25], they achieved at least G 1 continuity for the color.…”
Section: Irregular Meshesmentioning
confidence: 99%
See 1 more Smart Citation
“…Beatson et al [10] then extended the domain to piecewise quadratic boundaries, where they proposed the Hermite mean value interpolation technique for polygons. Hettinga et al [53] further adjusted the interpolation schemes from generalized Bézier patches [125] and Charrot-Gregory corner interpolation patches [22] (both are multi-sided parametric patches) such that the interpolation scheme can be used for 2D gradient meshes. By using the algorithm from Chiyokura and Kimura [25], they achieved at least G 1 continuity for the color.…”
Section: Irregular Meshesmentioning
confidence: 99%
“…Fig. 5: Patches of arbitrary shape, filled with constant color.al [53]. investigated several schemes to interpolate the values and gradients of color from boundary conditions, including the approach for topologically unrestricted gradient meshes by Lieng et al[86], the cubic mean value coordinates by Li et al[81], and two newly-proposed interpolation methods based on the Gregory generalized Bézier patch and the Charrot-Gregory corner interpolator.…”
mentioning
confidence: 99%
“…However, the regular topology requirement and lack of support for local refinement limit its usability and expressiveness, mostly due to an extensive number of patches that are generated. The regular topology restriction has been addressed and alleviated by using either generalised barycentric coordinates [LJH13, HBK19], loop subdivision surfaces [Loo87] or Catmull–Clark subdivision surfaces [LKSD17]. The latter approach, often called the subdivision gradient mesh , is especially useful as it has basically the same functionality as traditional gradient meshes, but with the added advantage of unstructured topology and increased smoothness.…”
Section: Related Workmentioning
confidence: 99%
“…Image vectorization based on gradient mesh [17,18] is also available. To prove it, there are some studies that discovered color operations by gradient mesh [19][20][21][22].…”
Section: Related Workmentioning
confidence: 99%