• DocumentCode
    3116157
  • Title

    Simplification of vector fields over tetrahedral meshes

  • Author

    Platis, Nikos ; Theoharis, Theoharis

  • Author_Institution
    Dept. of Inf. & Telecommun., Athens Univ.
  • fYear
    2004
  • fDate
    19-19 June 2004
  • Firstpage
    174
  • Lastpage
    181
  • Abstract
    Vector fields produced by experiments or simulations are usually extremely dense, which makes their manipulation and visualization cumbersome. Often, such fields can be simplified without much loss of information. A simplification method for 3D vector fields defined over tetrahedral meshes is presented. The underlying tetrahedral mesh is progressively simplified by successive half-edge collapses. The order of collapses is determined by a compound metric which takes into account the field and domain error incurred as well as the quality of the resulting mesh. Special attention is given to the preservation of the mesh boundary and of critical points on the vector field. A tool has been developed for the measurement of the difference between two vector fields over tetrahedral meshes, and it is used to quantify the simplification error
  • Keywords
    computational geometry; data visualisation; mesh generation; solid modelling; data visualization; successive half-edge collapses; tetrahedral meshes; vector fields simplification; Approximation error; Computer errors; Costs; Data acquisition; Data visualization; Informatics; Interpolation; Iterative methods; Software tools; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Graphics International, 2004. Proceedings
  • Conference_Location
    Crete
  • ISSN
    1530-1052
  • Print_ISBN
    0-7695-2171-1
  • Type

    conf

  • DOI
    10.1109/CGI.2004.1309208
  • Filename
    1309208