<p>I essentially know of 2 geometry processing data structures. one is the half edge (which has some really nice properties, but can't represent non manifold meshes nor tet meshes).</p>

<p>The other is an extended adjacency list representation of the graph connectivity that also stores faces and edges.</p>

<p>Are there more?</p>

CC BY-SA 4.0
2020-01-15T05:17:23.897Z
Full edge epresentation where the edge has a list of connections.
joojaa
CC BY-SA 4.0
2020-01-15T09:46:39.627Z
Are you mainly (only?) interested in 3D geometry or is 2D also of interest?
Simon F
CC BY-SA 4.0
2020-01-15T16:24:14.227Z
2D is acceptable, but I am definitely more interested in 3D
Makogan
CC BY-SA 4.0
2020-01-16T07:39:15.783Z
My favorite 3D data structure is combinatorial map (cf. for example one implementation in CGAL here https://doc.cgal.org/latest/Combinatorial_map/).
gdamiand
CC BY-SA 4.0
2020-01-16T09:21:53.040Z
You could look at [Data structures for simplicial complexes: an analysis and a comparison](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.9969&rep=rep1&type=pdf) by de Floriani and Hui; it covers structures in 2D and 3D, but if you want to represent something other than triangular / tetrahedral meshes there are other things out there.
gilgamec
<algorithm><computational-geometry><geometry><data-structure>
What other geometry processing data structures are there?
Makogan
# What other geometry processing data structures are there?

(Asked by: username_0 on 2020-01-15)

I essentially know of 2 geometry processing data structures. one is the half edge (which has some really nice properties, but can't represent non manifold meshes nor tet meshes).

The other is an extended adjacency list representation of the graph connectivity that also stores faces and edges.

Are there more?

**Tags:** algorithm, computational-geometry, geometry, data-structure

> **Comments:**
> **username_1**: Full edge epresentation where the edge has a list of connections.  
> **username_2**: Are you mainly (only?) interested in 3D geometry or is 2D also of interest?  
> **username_0**: 2D is acceptable, but I am definitely more interested in 3D  
> **username_3**: My favorite 3D data structure is combinatorial map (cf. for example one implementation in CGAL here https://doc.cgal.org/latest/Combinatorial_map/).  
> **username_4**: You could look at [Data structures for simplicial complexes: an analysis and a comparison](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.9969&rep=rep1&type=pdf) by de Floriani and Hui; it covers structures in 2D and 3D, but if you want to represent something other than triangular / tetrahedral meshes there are other things out there.  

---

## 0 answers

