Halfedge Data Structures
A halfedge data structure (abbreviated as HalfedgeDS, or HDS for template parameters) is an edge-centered data structure capable of maintaining incidence information of vertices, edges and faces, for example for planar maps, polyhedra, or other orientable, two-dimensional surfaces embedded in arbitrary dimension. Each edge is decomposed into two halfedges with opposite orientations. One incident face and one incident vertex are stored in each halfedge. For each face and each vertex, one incident halfedge is stored. Reduced variants of the halfedge data structure can omit some of these information, for example the halfedge pointers in faces or the storage of faces at all.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Eder, Günther; Held, Martin; Palfrader, Peter: Implementing straight skeletons with exact arithmetic: challenges and experiences (2021)
- Sanchez-Rivadeneira, A. G.; Shauer, N.; Mazurowski, B.; Duarte, C. A.: A stable generalized/extended (p)-hierarchical FEM for three-dimensional linear elastic fracture mechanics (2020)
- Carr, Hamish (ed.); Garth, Christoph (ed.); Weinkauf, Tino (ed.): Topological methods in data analysis and visualization IV. Theory, algorithms, and applications. Selected papers based on the presentations at the TopoInVis workshop, Annweiler, Germany, 2015 (2017)
- Adolf, Florian-M.; Hirschmüller, Heiko: Meshing and simplification of high resolution urban surface data for UAV path planning (2011) ioport
- Cazals, Frédéric; Loriot, Sébastien: Computing the arrangement of circles on a sphere, with applications in structural biology (2009)