|
A quad-edge data structure is a computer representation of the topology of a two-dimensional or three-dimensional map, that is, a graph drawn on a (closed) surface. ==Overview== The quad-edge data structure: * represents simultaneously both the map, its dual and mirror image. * can represent the most general form of a map, admitting vertices and faces of degree 1 and 2. * is a variant of the earlier winged edge data structure. The fundamental idea behind the quad-edge structure is the recognition that a single edge, in a closed polygonal mesh topology, sits between exactly two faces and exactly two vertices. Thus, it can represent a dual of the graph simply by reversing the convention on what is a vertex and what is a face. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Quad-edge」の詳細全文を読む スポンサード リンク
|