Navigation: Up, Table of Contents, Bibliography, Index, Title Page

Halfedge (Dcel::Halfedge)

Definition

A halfedge stores pointers for the next halfedge and its twin halfedge. It also stores pointers to an incident face and an incident vertex. A halfedge is an oriented edge between two vertices. It is always paired with its counterpart that has the opposite direction. They are mutually linked with the opposite() function.

Types

Dcel::Halfedge::Vertex
corresponding vertex type.

Dcel::Halfedge::Halfedge
self.

Dcel::Halfedge::Face
corresponding face type.

Operations

Halfedge* h.opposite () the twin halfedge.
const Halfedge* h.opposite ()
Halfedge* h.next () the next halfedge around the face.
const Halfedge* h.next ()
Vertex* h.vertex () an incident vertex.
const Vertex* h.vertex ()
Face* h.face () the incident face.
const Face* h.face ()
void h.set_next ( Halfedge* next)
void h.set_vertex ( Vertex* v)
void h.set_face ( Face* f)

Next: Class declaration of Dcel::Face
Navigation: Up, Table of Contents, Bibliography, Index, Title Page
The CGAL Project. 22 January, 1999.