Skip to search formSkip to main contentSkip to account menu

Doubly connected edge list

Known as: DCEL, Doubly-connected edge list, Half-edge data structure 
The doubly connected edge list (DCEL), also known as half-edge data structure, is a data structure to represent an embedding of a planar graph in the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
An efficient edge based data structure has been developed in order to implement a compressible Navier-Stokes solver based on a… 
2016
2016
We generalize the transfinite triangular interpolant of (Nielson, 1987) in order to generate visually smooth (not necessarily… 
2015
2015
Progressive mesh (PM) representation can perfectly meet the requirements of generating multi-resolutions for a detailed 3D model… 
2008
2008
The geometrical concept of the Voronoi diagram was used to create an image filter providing a “stained glass” or mosaic effect on… 
2008
2008
The invention relates to a data structure of a three-dimensional mesh model and real-time sectioning operations thereof in a… 
2008
2008
We present the Combined B-rep (cB-rep) as a multiresolution data structure suitable for interactive modeling and visualization of… 
2003
2003
We present the Combined BRep as a multiresolution data structure suitable for interactive modeling and visualization of models… 
2003
2003
An approach for computing a hierarchical approximation of planar Voronoi diagrams for different site shapes (points, line… 
1984
1984
In this paper tracking of the fast frequency hopping spread spectrum signals is analised. It is shown that the traditional "early…