High-Quality Curve Rendering using Line Sampled Visibility
(2012) In ACM Transactions on Graphics 31(6). p.162-162- Abstract
- Computing accurate visibility for thin primitives, such as hair strands, fur, grass, at all scales remains difficult or expensive. To that end, we present an efficient visibility algorithm based on spatial line sampling, and a novel intersection algorithm between line sample planes and Bezier splines with varying thickness. Our algorithm produces accurate visibility both when the projected width of the curve is a tiny fraction of a pixel, and when the projected width is tens of pixels. In addition, we present a rapid resolve procedure that computes final visibility. Using an optimized implementation running on graphics processors, we can render tens of thousands long hair strands with noise-free visibility at near-interactive rates.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3373212
- author
- Barringer, Rasmus LU ; Gribel, Carl Johan LU and Akenine-Möller, Tomas LU
- organization
- publishing date
- 2012
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- analytical visibility, anti-aliasing, curve rendering
- in
- ACM Transactions on Graphics
- volume
- 31
- issue
- 6
- pages
- 162 - 162
- publisher
- Association for Computing Machinery (ACM)
- external identifiers
-
- wos:000311298900036
- scopus:84870179835
- ISSN
- 0730-0301
- DOI
- 10.1145/2366145.2366181
- language
- English
- LU publication?
- yes
- id
- c6ad6922-0a98-4989-b8b8-040c82c40bef (old id 3373212)
- date added to LUP
- 2016-04-01 13:54:09
- date last changed
- 2022-04-29 22:49:26
@article{c6ad6922-0a98-4989-b8b8-040c82c40bef, abstract = {{Computing accurate visibility for thin primitives, such as hair strands, fur, grass, at all scales remains difficult or expensive. To that end, we present an efficient visibility algorithm based on spatial line sampling, and a novel intersection algorithm between line sample planes and Bezier splines with varying thickness. Our algorithm produces accurate visibility both when the projected width of the curve is a tiny fraction of a pixel, and when the projected width is tens of pixels. In addition, we present a rapid resolve procedure that computes final visibility. Using an optimized implementation running on graphics processors, we can render tens of thousands long hair strands with noise-free visibility at near-interactive rates.}}, author = {{Barringer, Rasmus and Gribel, Carl Johan and Akenine-Möller, Tomas}}, issn = {{0730-0301}}, keywords = {{analytical visibility; anti-aliasing; curve rendering}}, language = {{eng}}, number = {{6}}, pages = {{162--162}}, publisher = {{Association for Computing Machinery (ACM)}}, series = {{ACM Transactions on Graphics}}, title = {{High-Quality Curve Rendering using Line Sampled Visibility}}, url = {{http://dx.doi.org/10.1145/2366145.2366181}}, doi = {{10.1145/2366145.2366181}}, volume = {{31}}, year = {{2012}}, }