Name
Abstract | ||
|---|---|---|
Procedural textile models are compact, easy to edit, and can achieve state-of-the-art realism with fiber-level details. However, these complex models generally need to be fully instantiated aka. realized into 3D volumes or fiber meshes and stored in memory, We introduce a novel realization-minimizing technique that enables physically based rendering of procedural textiles, without the need of full model realizations. The key ingredients of our technique are new data structures and search algorithms that look up regular and flyaway fibers on the fly, efficiently and consistently. Our technique works with compact fiber-level procedural yarn models in their exact form with no approximation imposed. In practice, our method can render very large models that are practically unrenderable using existing methods, while using considerably less memory 60-200× less and achieving good performance. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1111/cgf.13230 | Comput. Graph. Forum |
Field | DocType | Volume |
Data structure,Computing Methodologies,Search algorithm,Polygon mesh,Procedural modeling,Yarn,Computer science,Algorithm,Theoretical computer science,Textile,Rendering (computer graphics),Computer engineering | Journal | 36 |
Issue | ISSN | Citations |
4 | 0167-7055 | 3 |
PageRank | References | Authors |
0.38 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| fujun luan | 1 | 6 | 2.46 |
| Shuang Zhao | 2 | 358 | 26.74 |
| Kavita Bala | 3 | 2046 | 138.75 |