DiagSplit: parallel, crack-free, adaptive tessellation for micropolygon rendering

  • Authors:
  • Matthew Fisher;Kayvon Fatahalian;Solomon Boulos;Kurt Akeley;William R. Mark;Pat Hanrahan

  • Affiliations:
  • Stanford University;Stanford University;Stanford University;Microsoft Research;Intel Corporation;Stanford University

  • Venue:
  • ACM SIGGRAPH Asia 2009 papers
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present DiagSplit, a parallel algorithm for adaptively tessellating displaced parametric surfaces into high-quality, crack-free micropolygon meshes. DiagSplit modifies the split-dice tessellation algorithm to allow splits along non-isoparametric directions in the surface's parametric domain, and uses a dicing scheme that supports unique tessellation factors for each subpatch edge. Edge tessellation factors are computed using 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 split-dice implementations that are less amenable to parallelization.