Representation of a half-edge in the half-edge data structure. More...

#include <Union_of_balls_boundary_3_data_structure.hpp>

Constructors
	T_Union_of_balls_boundary_3_half_edge (void)

	T_Union_of_balls_boundary_3_half_edge (const Edge &edge, unsigned index, bool is_full_circle, bool is_degenerated)

Queries
bool	is_full_circle (void) const
	A halfedge is a full circle if it incident to no vertex. More...

bool	is_degenerated (void) const
	A halfedge is degenerated iff it is the only one intersection point of 2 spheres. More...

bool	is_incident_to_degenerated_vertex (void) const
	The incident vertex is degenerated. More...

bool	is_degenerated_full_circle (void) const
	The halfedge is a full circle incident to a degenerated vertex. More...

Accessors
const WeightedAlphaComplex3::Edge &	get_dual_simplex (void) const

unsigned	get_index (void) const

Queries
bool	is_incident_cell (Cell_handle cell) const

bool	is_exterior (void) const

Modifiers
void	add_incident_cell (Cell_handle cell, const WeightedAlphaComplex3 &A)

void	set_exterior (bool b)

Traversals
Incident_cell_iterator	incident_cells_begin (void) const

Incident_cell_iterator	incident_cells_end (void) const

Detailed Description

Representation of a half-edge in the half-edge data structure.

Template Parameters

Ref	Internal class.
WeightedAlphaComplex3	A Model of the 3D Weighted $\alpha$ -complex of the CGAL Library.

Member Function Documentation

bool is_degenerated ( void ) const

inline

A halfedge is degenerated iff it is the only one intersection point of 2 spheres.

bool is_degenerated_full_circle ( void ) const

inline

The halfedge is a full circle incident to a degenerated vertex.

bool is_full_circle ( void ) const

inline

A halfedge is a full circle if it incident to no vertex.

bool is_incident_to_degenerated_vertex ( void ) const

inline

The incident vertex is degenerated.