Fat Borders: Gap Filling For Efficient View-dependent LOD NURBS Rendering

D. Reiners, D. Fellner, Reinhard Klein, and J. Kautz (Editors)

Ákos Balázs, Michael Guthe, and Reinhard Klein

In: Computers and Graphics (Feb. 2004), 28:1(79-86)

Abstract

Real-time high quality rendering of complex NURBS models remains a big challenge. Simply splitting the models into several parts which can be simplified and rendered independently introduces disturbing gaps along the common borders. Recent approaches for view-dependent rendering of huge models either neglect the artifacts introduced by the gaps or try to maintain the connectivity of the models. Unfortunately, in the second case the computational complexity and storage requirements of the algorithms are high. In this work we present a novel solution to the gap problem. Vertex programs are used to generate appropriately shaded fat borders that fill the gaps between neighbouring patches.

Keywords: fragment program, gap closing, level of detail, NURBS animation, NURBS rendering, vertex program, view-dependent rendering

Bibtex

@ARTICLE{balazs-2004-fat-borders,
     author = {Bal{\'a}zs, {\'A}kos and Guthe, Michael and Klein, Reinhard},
     editor = {Reiners, D. and Fellner, D. and Klein, Reinhard and Kautz, J.},
      pages = {79--86},
      title = {Fat Borders: Gap Filling For Efficient View-dependent LOD NURBS Rendering},
    journal = {Computers and Graphics},
     volume = {28},
     number = {1},
       year = {2004},
      month = feb,
  publisher = {Elsevier},
   keywords = {fragment program, gap closing, level of detail, NURBS animation, NURBS rendering, vertex program,
               view-dependent rendering},
   abstract = {Real-time high quality rendering of complex NURBS models remains a big challenge. Simply splitting
               the models into several parts which can be simplified and rendered independently introduces
               disturbing gaps along the common borders. Recent approaches for view-dependent rendering of huge
               models either neglect the artifacts introduced by the gaps or try to maintain the connectivity of
               the models. Unfortunately, in the second case the computational complexity and storage requirements
               of the algorithms are high. In this work we present a novel solution to the gap problem. Vertex
               programs are used to generate appropriately shaded fat borders that fill the gaps between
               neighbouring patches.},
       issn = {0097-8493}
}