Does a 3D Half-Edge Data Structure Exist?

  • Context: Graduate 
  • Thread starter Thread starter Ole Lindberg
  • Start date Start date
  • Tags Tags
    3d Data Structure
Click For Summary
SUMMARY

The discussion centers on the existence of a 3D half-edge data structure for unstructured quadrilateral meshes in computational fluid dynamics, specifically for a discontinuous Galerkin free surface flow model. Ole Lindberg inquires about the availability of a "half-face" structure analogous to the 2D half-edge data structure. A participant suggests using a binary tree representation as a more efficient alternative for managing unstructured meshes of polygons, tetrahedrals, and quadrilaterals, referencing a relevant academic source for further reading.

PREREQUISITES
  • Understanding of half-edge data structures in 2D mesh representation
  • Familiarity with unstructured mesh concepts in computational fluid dynamics
  • Knowledge of binary tree data structures
  • Experience with discontinuous Galerkin methods
NEXT STEPS
  • Research the implementation of 3D half-edge data structures for mesh representation
  • Explore binary tree data structures for efficient mesh management
  • Study the discontinuous Galerkin method in detail
  • Review the referenced academic paper on binary tree representations in mesh structures
USEFUL FOR

Researchers and developers working on computational fluid dynamics, particularly those focused on mesh generation and optimization for complex geometries.

Ole Lindberg
Messages
1
Reaction score
0
Hello Everyone

I'm currently working on a unstructured quadrilateral mesh for a discontinuous galerkin free surface flow model. I use the half-edge data structure in the two dimensional code. Does something like a half-edge or "half-face" three dimensional data structure exist.

Otherwise which data structure do you prefer for an unstructured mesh of polygons tetrahedrals and quadrilaterals.

Greetings

Ole Lindberg, Denmark
 
Physics news on Phys.org
While I don't know much about your application, I found a reference on the web that suggested a binary tree representation as the most efficient and have attached the reference for you:

http://onlinelibrary.wiley.com/doi/...10)49:10<1327::AID-NME996>3.0.CO;2-L/abstract

there's a link to a PDF following the abstract that describes the details and is an excerpt from the book they are selling.

So it looks like the tree is useful as you continue to fracture the surface into smaller and smaller pieces they can be added to the existing node from which they came.
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 25 ·
Replies
25
Views
6K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K