TopologicalMapDcelHalfedge

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

TopologicalMapDcelHalfedge

Definition

A halfedge stores pointers to the next halfedge along the same face and to its twin halfedge. It also stores pointers to an incident face and to 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

TopologicalMapDcelHalfedge::Vertex
corresponding vertex type.

TopologicalMapDcelHalfedge::Face
corresponding face type.

Access Functions

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 ()

Modifiers

void h.set_next ( Halfedge* next)
set next halfedge

void h.set_vertex ( Vertex* v)
set incident vertex

void h.set_face ( Face* f)
set incident face

TopologicalMapDcelHalfedge::Vertex
	corresponding vertex type.
TopologicalMapDcelHalfedge::Face
	corresponding face type.

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)*
		set next halfedge
void	h.set_vertex ( Vertex v)*
		set incident vertex
void	h.set_face ( Face f)*
		set incident face