CGAL::Iso_box_d< Kernel > Class Template Reference

#include <CGAL/Kernel_d/Iso_box_d.h>

Definition

template<typename Kernel>
class CGAL::Iso_box_d< Kernel >

An object \( b\) of the data type Iso_box_d is an iso-box in the Euclidean space \( \E^d\) with edges parallel to the axes of the coordinate system.

Creation
	Iso_box_d (const Point_d< Kernel > &p, const Point_d< Kernel > &q)
	introduces an iso-oriented iso-box b with diagonal opposite vertices \( p\) and \( q\). More...

Operations
bool	operator== (const Iso_box_d< Kernel > &b2) const
	Test for equality: two iso-oriented cuboid are equal, iff their lower left and their upper right vertices are equal. More...
bool	operator!= (const Iso_box_d< Kernel > &b2) const
	Test for inequality. More...
const Point_d< Kernel > &	min () const
	returns the smallest vertex of b. More...
const Point_d< Kernel > &	max () const
	returns the largest vertex of b. More...

Predicates
bool	is_degenerate () const
	b is degenerate, if all vertices are collinear. More...
Bounded_side	bounded_side (const Point_d< Kernel > &p) const
	returns either ON_UNBOUNDED_SIDE, ON_BOUNDED_SIDE, or the constant ON_BOUNDARY, depending on where point \( p\) is. More...
bool	has_on_boundary (const Point_d< Kernel > &p) const
bool	has_on_bounded_side (const Point_d< Kernel > &p) const
bool	has_on_unbounded_side (const Point_d< Kernel > &p) const

Miscellaneous
Kernel_d::FT	volume () const
	returns the volume of b. More...

Constructor & Destructor Documentation

Iso_box_d()

template<typename Kernel >

CGAL::Iso_box_d< Kernel >::Iso_box_d	(	const Point_d< Kernel > &	p,
		const Point_d< Kernel > &	q
	)

introduces an iso-oriented iso-box b with diagonal opposite vertices \( p\) and \( q\).

Member Function Documentation

bounded_side()

template<typename Kernel >

Bounded_side CGAL::Iso_box_d< Kernel >::bounded_side

(

const Point_d< Kernel > &

p

)

const

returns either ON_UNBOUNDED_SIDE, ON_BOUNDED_SIDE, or the constant ON_BOUNDARY, depending on where point \( p\) is.

has_on_boundary()

template<typename Kernel >

bool CGAL::Iso_box_d< Kernel >::has_on_boundary

(

const Point_d< Kernel > &

p

)

const

has_on_bounded_side()

template<typename Kernel >

bool CGAL::Iso_box_d< Kernel >::has_on_bounded_side

(

const Point_d< Kernel > &

p

)

const

has_on_unbounded_side()

template<typename Kernel >

bool CGAL::Iso_box_d< Kernel >::has_on_unbounded_side

(

const Point_d< Kernel > &

p

)

const

is_degenerate()

template<typename Kernel >

bool CGAL::Iso_box_d< Kernel >::is_degenerate

(

)

const

b is degenerate, if all vertices are collinear.

max()

template<typename Kernel >

const Point_d<Kernel>& CGAL::Iso_box_d< Kernel >::max

(

)

const

returns the largest vertex of b.

min()

template<typename Kernel >

const Point_d<Kernel>& CGAL::Iso_box_d< Kernel >::min

(

)

const

returns the smallest vertex of b.

operator!=()

template<typename Kernel >

bool CGAL::Iso_box_d< Kernel >::operator!=

(

const Iso_box_d< Kernel > &

b2

)

const

Test for inequality.

operator==()

template<typename Kernel >

bool CGAL::Iso_box_d< Kernel >::operator==

(

const Iso_box_d< Kernel > &

b2

)

const

Test for equality: two iso-oriented cuboid are equal, iff their lower left and their upper right vertices are equal.

volume()

template<typename Kernel >

Kernel_d::FT CGAL::Iso_box_d< Kernel >::volume

(

)

const

returns the volume of b.