Adjacency Data Structures - Simple Data Structures for Meshes


Adjacency Data Structures Simple Data Structures for Meshes

II. Simple Data Structures for Meshes

  1. Data Structures

    • List of Polygons:


      1. (3,-2,5), (3,6,2), (-6,2,4)
      2. (2,2,4), (0,-1,-2), (9,4,0), (4,2,9)
      3. (1,2,-2), (8,8,7), (-4,-5,1)
      4. (-8,2,7), (-2,3,9), (1,2,-7)
    • List of Edges:


      1. (3,6,2), (-6,2,4)
      2. (2,2,4), (0,-1,-2)
      3. (9,4,0), (4,2,9)
      4. (8,8,7), (-4,-5,1)
      5. (-8,2,7), (1,2,-7)
      6. (3,0,-3), (-7,4,-3)
      7. (9,4,0), (4,2,9)
      8. (3,6,2), (-6,2,4)
      9. (-3,0,-4), (7,-3,-4)
    • List of Unique Vertices + Indexed Faces:


      • Vertices:
        1. (-1, -1, -1)
        2. (-1, -1, 1)
        3. (-1, 1, -1)
        4. (-1, 1, 1)
        5. (1, -1, -1)
        6. (1, -1, 1)
        7. (1, 1, -1)
        8. (1, 1, 1)


      • Faces:
        1. 1 2 4 3
        2. 5 7 8 6
        3. 1 5 6 2
        4. 3 4 8 7
        5. 1 3 7 5
        6. 2 6 8 4

  2. Problems

    • No Adjacency Information
    • Linear-Time Searches


This page created and maintained by Justin Legakis
legakis@graphics.lcs.mit.edu
Last modified: 2/14/98