Half-Edge Data Structures (2019)
jerryyin.info
Half-Edge Data Structures (2019)
1–9 of 9 posts
Re: Half-Edge Data Structures (2019)
#2Another very good blog overview here (not mine): https://ianthehenry.com/posts/delaunay/
I love DCELs and have been tinkering with them in my own side projects lately. Very cool data structure!
Re: Half-Edge Data Structures (2019)
#3The original GLU Tessellator[1][2] used that structure for most of its internal representation of meshes, it's a very powerful data structure for meshes.
[1] https://github.com/memononen/libtess2/blob/fc52516467dfa124b...
Re: Half-Edge Data Structures (2019)
#4In action:
https://doc.cgal.org/latest/Surface_mesh/index.html
Built on top of boost graph.
Re: Half-Edge Data Structures (2019)
#5The Symbolics Lisp Machine S-Geometry 3D modeler from the mid 1980's was based on the winged-edge structure. It was the best polygonal modeler of its time, and the package lives on in philosophy as the Wings3D open source modeler.
Re: Half-Edge Data Structures (2019)
#6The difficulty, in a geometric setting, is still how to maintain a robust correspondence between geometry and topology.
Re: Half-Edge Data Structures (2019)
#7A little margin/padding would go a long way
Re: Half-Edge Data Structures (2019)
#8I enjoyed reading this book a few years ago: https://www.amazon.com/Introduction-Solid-Modeling-Martti-Ma...
Re: Half-Edge Data Structures (2019)
#9This article would be more clear if the & symbol were clarified. Right now it looks like Rust borrowing in Python. Maybe I’m too dumb and didn’t read it right and missed the definition. Anyway the big picture idea is cool and resonates with the idea of a bidirectional HashMap.