• Title of article

    Applications of Formanʹs discrete Morse theory to topology visualization and mesh compression

  • Author/Authors

    Lewiner، نويسنده , , T.، نويسنده , , Lopes، نويسنده , , H.، نويسنده , , Tavares، نويسنده , , G.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2004
  • Pages
    10
  • From page
    499
  • To page
    508
  • Abstract
    Morse theory is a powerful tool for investigating the topology of smooth manifolds. It has been widely used by the computational topology, computer graphics, and geometric modeling communities to devise topology-based algorithms and data structures. Forman introduced a discrete version of this theory which is purely combinatorial. This work aims to build, visualize, and apply the basic elements of Forman’s discrete Morse theory. It intends to use some of those concepts to visually study the topology of an object. As a basis, an algorithmic construction of optimal Forman’s discrete gradient vector fields is provided. This construction is then used to topologically analyze mesh compression schemes, such as Edgebreaker and Grow&Fold. In particular, this paper proves that the complexity class of the strategy optimization of Grow&Fold is MAX-SNP hard.
  • Keywords
    Hypergraphs , data compaction and compression , computer fraphics , computer-aided design. , discrete mathematics
  • Journal title
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
  • Serial Year
    2004
  • Journal title
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
  • Record number

    401775