DiagSplit: Parallel, Crack-Free, Adaptive Tessellation for Micropolygon Rendering

1 Stanford University 2 Microsoft Research 3 Intel Corporation
ACM Transactions on Graphics (Proc. SIGGRAPH Asia 2009)

Abstract


We present DiagSplit, a highly parallel algorithm for adaptively tessellating displaced parametric surfaces into high-quality, crack free micropolygon meshes. DiagSplit modifies the split-dice tessellation algorithm to make splits using non-isoparametric cuts in the surface's parametric domain, and uses a dicing scheme that supports unique tessellation factors for each subpatch edge. Splitting and edge tessellation factor computations use only information local to subpatch edges. These modifications allow all subpatches generated by DiagSplit to be processed independently without introducing T-junctions or mesh cracks and without incurring the tessellation overhead of binary dicing. We demonstrate that DiagSplit produces output that is better (in terms of image quality and number of micropolygons produced) than existing parallel tessellation schemes, and as good as highly adaptive, but hard to parallelize, split-dice implementations.

Extras


Paper: PDF

Google Scholar:

BibTeX citation:
@inproceedings{fisher2009diagsplit,
title={DiagSplit: parallel, crack-free, adaptive tessellation for micropolygon rendering},
author={Fisher, Matthew and Fatahalian, Kayvon and Boulos, Solomon and Akeley, Kurt and Mark, William R and Hanrahan, Pat},
booktitle={ACM Transactions on Graphics (TOG)},
volume={28},
number={5},
pages={150},
year={2009},
organization={ACM}
}