ACM SIGGRAPH 2005 Sketches on - SIGGRAPH '05 2005
DOI: 10.1145/1187112.1187270
|View full text |Cite
|
Sign up to set email alerts
|

Efficient magnification of bi-level textures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2007
2007
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…Another idea is to deform the underlying pixel grid by explicitly storing discontinuity information along general curves [Tarini and Cignoni 2005]. Loviscach [2005] optimized MIP maps, such that the thresholded values match a reference. Similar ideas were also being explored for textures and shadow maps [Sen 2004;Sen et al 2003], addressing specific challenges in sampling.…”
Section: Related Workmentioning
confidence: 99%
“…Another idea is to deform the underlying pixel grid by explicitly storing discontinuity information along general curves [Tarini and Cignoni 2005]. Loviscach [2005] optimized MIP maps, such that the thresholded values match a reference. Similar ideas were also being explored for textures and shadow maps [Sen 2004;Sen et al 2003], addressing specific challenges in sampling.…”
Section: Related Workmentioning
confidence: 99%
“…The numerous rendering methods that have been proposed can be classified into (a) analytic methods that use a closed form solution (Korein & Badler, 1983;Grant, 1985), (b) geometric substitution that substitute the original geometry with alternative geometric primitives for which temporal changes are followed (Catmull, 1984;Glassner, 1988;Guan & Mueller, 2004;Jones & Keyser, 2005; Schmid, Sumner, Bowles, & Gross, 2010) (c) texture clamping, which originally targets the elimination of aliasing effects (Loviscach, 2005) Chen, Doggett, & Durand, 2010), (e) post-processing methods that are screen space methods that use selected pre-renders of a scene blurred by using motion information from available scene data, decoupling motion blurring from rendering (Max & Lerner, 1985;Chen & Williams, 1993;Zheng, Koestler, Thuerey, & Ruede, 2006;Vlachos, 2008;Sousa, 2008), (f) hybrid techniques (Sung, Pearce, & Wang, 2002) and (g) physics-based approaches that exploit mechanics and optics to device models for motion blur simulation (Lin & Chang, 2006;Telleen, Sullivan, Yee, Wang, Gunawardane, Collins, & Davis, 2007;Pachur, Laue, & Roefer, 2009).…”
Section: Motion Blurmentioning
confidence: 99%
“…Prior GPU schemes limit the complexity of the outline within each image cell, such as a few line segments [Sen et al 2003[Sen et al , 2004Tumblin and Choudhury 2004;Lefebvre and Hoppe 2006], an implicit bilinear curve [Tarini and Cignoni 2005;Loviscach 2005], a parametric cubic curve [Ray et al 2005], two quadratic segments [Parilov and Zorin 2008], or a fixed number of corner features [Qin et al 2006]. A drawback of fixed-complexity cells is that small areas of high detail (e.g.…”
Section: Related Workmentioning
confidence: 99%