Efficient Bounded Adaptive Tessellation of Displacement Maps
Kevin Moule, Michael D. McCool
Graphics Interface 2002, May 2002, pp. 171--180.
Abstract: Displacement mapping is a technique for applying fine geometric detail to a simpler base surface. The displacement is often specified as a scalar function which makes it relatively easy to increase visual complexity without the difficulties inherent in more general modeling techniques. We would like to use displacement mapping in real-time applications. Ideally, a graphics accelerator should create a polygonal tessellation of the displaced surface on the fly to avoid storage and host bandwidth overheads.

We present an online, adaptive, crack-free tessellation scheme for real-time displacement mapping that uses only local information for each triangle to perform a view-dependent tessellation. The tessellation works in homogeneous coordinates and avoids re-transformation of displaced points, making it suitable for high-performance hardware implementation. The use of interval analysis produces meshes with good error bounds that converge quickly to the true surface.
BibTeX format:
@inproceedings{Moule:2002:EBA,
  author = {Kevin Moule and Michael D. McCool},
  title = {Efficient Bounded Adaptive Tessellation of Displacement Maps},
  booktitle = {Graphics Interface 2002},
  pages = {171--180},
  month = may,
  year = {2002},
}
Search for more articles by Kevin Moule.
Search for more articles by Michael D. McCool.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."