A Tessellator Whose Tessellation Time Grows Linearly With The Amount Of Tessellation

In accordance with some embodiments, a tessellator may experience only a linear increase in tessellation time with increasing edge levels of detail. Conventionally, tessellators experience a non-linear or quadratic increase in tessellation time with increasing levels of detail. In some embodiments, the intervals and the triangulation of the inner tessellation may be pre-computed. Then at run time, the pre-computed values may be looked up for the applicable edge level of detail.

Rahul P Sathe, and Paul Rosen. A Tessellator Whose Tessellation Time Grows Linearly With The Amount Of Tessellation. IEEE Transactions on Visualization and Computer Graphics (TVCG), 2010.

@misc{sathe2010tessellator,
  title = {A Tessellator Whose Tessellation Time Grows Linearly with the Amount of
    Tessellation},
  author = {Sathe, Rahul P and Rosen, Paul},
  year = {2010},
  note = {Intel Corp., Application~12/347,114, Filed December 2008},
  abstract = {In accordance with some embodiments, a tessellator may experience only a
    linear increase in tessellation time with increasing edge levels of detail.
    Conventionally, tessellators experience a non-linear or quadratic increase in
    tessellation time with increasing levels of detail. In some embodiments, the intervals
    and the triangulation of the inner tessellation may be pre-computed. Then at run time,
    the pre-computed values may be looked up for the applicable edge level of detail.}
}