Please enable JavaScript.

Coggle requires JavaScript to display documents.

Project 1: Research Roadmap (Comparing efficient data structures to…

- - - - https://www2.cs.sfu.ca/~binay/813.2011/DCEL.pdf
        
        Voronoi Diagrams
      - https://en.wikipedia.org/wiki/Doubly_connected_edge_list
      - Polygon Mesh
        
        https://pages.mtu.edu/~shene/COURSES/cs3621/SLIDES/Mesh.pdf
        
        Representations
        
        Doubly linked face list
        
        https://en.wikipedia.org/wiki/Doubly_linked_face_list
        
        Corner-tables
        
        which store vertices in a predefined table, such that traversing the table implicitly defines polygons. This is in essence the triangle fan used in hardware graphics rendering. The representation is more compact, and more efficient to retrieve polygons, but operations to change polygons are slow. Furthermore, corner-tables do not represent meshes completely. Multiple corner-tables (triangle fans) are needed to represent most meshes.
        
        Quad-edge meshes
        
        https://en.wikipedia.org/wiki/Quad-edge
        
        which store edges, half-edges, and vertices without any reference to polygons. The polygons are implicit in the representation, and may be found by traversing the structure. Memory requirements are similar to half-edge meshes.
        
        Half-edge meshes
        
        Similar to winged-edge meshes except that only half the edge traversal information is used.
        
        http://sccg.sk/~samuelcik/dgs/half_edge.pdf
        
        Winged-edge
        
        https://en.wikipedia.org/wiki/Winged_edge
        
        in which each edge points to two vertices, two faces, and the four (clockwise and counterclockwise) edges that touch them. Winged-edge meshes allow constant time traversal of the surface, but with higher storage requirements.
        
        Face-vertex meshes
        
        searched "incrementally construct face-vertex system"
        
        https://www.sciencedirect.com/topics/computer-science/incremental-construction
        
        Convex hulls
        
        A simple list of vertices, and a set of polygons that point to the vertices it uses.
        
        https://en.wikipedia.org/wiki/Polygon_mesh