• DocumentCode
    21849
  • Title

    A Robust Parity Test for Extracting Parallel Vectors in 3D

  • Author

    Tao Ju ; Minxin Cheng ; Xu Wang ; Ye Duan

  • Author_Institution
    Washington Univ. in St. Louis, St. Louis, MO, USA
  • Volume
    20
  • Issue
    12
  • fYear
    2014
  • fDate
    Dec. 31 2014
  • Firstpage
    2526
  • Lastpage
    2534
  • Abstract
    Parallel vectors (PV), the loci where two vector fields are parallel, are commonly used to represent curvilinear features in 3D for data visualization. Methods for extracting PV usually operate on a 3D grid and start with detecting seed points on a cell face. We propose, to the best of our knowledge, the first provably correct test that determines the parity of the number of PV points on a cell face. The test only needs to sample along the face boundary and works for any choice of the two vector fields. A discretization of the test is described, validated, and compared with existing tests that are also based on boundary sampling. The test can guide PV-extraction algorithms to ensure closed curves wherever the input fields are continuous, which we exemplify in extracting ridges and valleys of scalar functions.
  • Keywords
    computational geometry; data visualisation; feature extraction; 3D extracting parallel vectors; 3D grid; PV-extraction algorithms; boundary sampling; data visualization; ridges extraction; robust parity test; scalar functions; vector fields; Algorithm design and analysis; Parallel processing; Parity check codes; Three-dimensional displays; Vectors; Parallel vectors; feature curve extraction; parity test; ridges and valleys;
  • fLanguage
    English
  • Journal_Title
    Visualization and Computer Graphics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1077-2626
  • Type

    jour

  • DOI
    10.1109/TVCG.2014.2346412
  • Filename
    6875965