songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
cgal/Packages/H2/include/CGAL/TriangleH2.h

376 lines
9.2 KiB
C++
Raw Blame History

// ======================================================================
//
// Copyright (c) 1999,2001 The CGAL Consortium
//
// This software and related documentation is part of an INTERNAL release
// of the Computational Geometry Algorithms Library (CGAL). It is not
// intended for general use.
//
// ----------------------------------------------------------------------
//
// release :
// release_date :
//
// file : TriangleH2.h
// package : H2
// revision : $Revision$
// revision_date : $Date$
// author(s) : Stefan Schirra
//
//
// coordinator : MPI, Saarbruecken (<Stefan.Schirra@mpi-sb.mpg.de>)
// ======================================================================
#ifndef CGAL_TRIANGLEH2_H
#define CGAL_TRIANGLEH2_H
#include <CGAL/PointH2.h>
#include <CGAL/predicates_on_pointsH2.h>
CGAL_BEGIN_NAMESPACE
template <class R>
class Triangle_repH2 : public Ref_counted
{
public:
Triangle_repH2() {}
Triangle_repH2(const PointH2<R> v1,
const PointH2<R> v2,
const PointH2<R> v3)
{
A[0] = v1;
A[1] = v2;
A[2] = v3;
_orientation = CGAL::orientation(v1,v2,v3); // FIXME : use the traits.
}
friend class TriangleH2<R>;
private:
PointH2<R> A[3];
Orientation _orientation;
};
template <class R>
class Simple_Triangle_repH2
{
public:
Simple_Triangle_repH2() {}
Simple_Triangle_repH2(const PointH2<R> v1,
const PointH2<R> v2,
const PointH2<R> v3)
{
A[0] = v1;
A[1] = v2;
A[2] = v3;
_orientation = CGAL::orientation(v1,v2,v3); // FIXME : use the traits.
}
friend class TriangleH2<R>;
private:
PointH2<R> A[3];
Orientation _orientation;
};
template <class R_>
class TriangleH2
: public R_::Triangle_handle_2
{
public:
typedef R_ R;
typedef typename R::FT FT;
typedef typename R::RT RT;
typedef typename R::Triangle_handle_2 Triangle_handle_2_;
typedef typename Triangle_handle_2_::element_type Triangle_ref_2;
TriangleH2()
: Triangle_handle_2_(Triangle_ref_2()) {}
TriangleH2(const PointH2<R>& p, const PointH2<R>& q, const PointH2<R>& r)
: Triangle_handle_2_(Triangle_ref_2(p, q, r)) {}
Bbox_2 bbox() const;
TriangleH2<R> opposite() const;
TriangleH2<R> transform(const Aff_transformationH2<R>&) const;
Orientation orientation() const;
Oriented_side oriented_side(const PointH2<R>& ) const;
Bounded_side bounded_side(const PointH2<R>& ) const;
bool has_on_positive_side( const PointH2<R>& ) const;
bool has_on_negative_side( const PointH2<R>& ) const;
bool has_on_boundary( const PointH2<R>& ) const;
bool has_on_bounded_side( const PointH2<R>& ) const;
bool has_on_unbounded_side(const PointH2<R>& )const;
bool is_degenerate() const;
bool operator==( const TriangleH2<R>& ) const;
bool operator!=( const TriangleH2<R>& ) const;
// bool oriented_equal( const TriangleH2<R>& ) const;
// bool unoriented_equal( const TriangleH2<R>& ) const;
const PointH2<R> & vertex(int i) const;
const PointH2<R> & operator[](int i) const;
FT area() const;
};
#ifdef CGAL_CFG_TYPENAME_BUG
#define typename
#endif
template <class R>
CGAL_KERNEL_INLINE
const PointH2<R> &
TriangleH2<R>::vertex(int i) const
{
if (i>2) i = i%3;
else if (i<0) i = (i%3) + 3;
return Ptr()->A[i];
}
template <class R>
inline
const PointH2<R> &
TriangleH2<R>::operator[](int i) const
{ return vertex(i); }
template <class R>
inline
typename TriangleH2<R>::FT
TriangleH2<R>::area() const
{
typedef typename TriangleH2<R>::FT FT;
VectorH2<R> v1 = vertex(1) - vertex(0);
VectorH2<R> v2 = vertex(2) - vertex(0);
return (v1.hx()*v2.hy() - v2.hx()*v1.hy())/(FT(2)*(v1.hw() * v2.hw()));
}
template <class R>
inline
Orientation
TriangleH2<R>::orientation() const
{ return Ptr()->_orientation; }
template <class R>
CGAL_KERNEL_MEDIUM_INLINE
Oriented_side
TriangleH2<R>::oriented_side( const PointH2<R>& p) const
{
Orientation o12 = CGAL::orientation( vertex(1), vertex(2), p);
Orientation o23 = CGAL::orientation( vertex(2), vertex(3), p);
Orientation o31 = CGAL::orientation( vertex(3), vertex(1), p);
if (Ptr()->_orientation == CLOCKWISE)
{
if ( (o12 == COUNTERCLOCKWISE)
||(o23 == COUNTERCLOCKWISE)
||(o31 == COUNTERCLOCKWISE) )
{
return ON_POSITIVE_SIDE;
}
if ( (o12 == COLLINEAR)
||(o23 == COLLINEAR)
||(o31 == COLLINEAR) )
{
return ON_ORIENTED_BOUNDARY;
}
else
{
return ON_NEGATIVE_SIDE;
}
}
else // COUNTERCLOCKWISE
{
if ( (o12 == CLOCKWISE)
||(o23 == CLOCKWISE)
||(o31 == CLOCKWISE) )
{
return ON_NEGATIVE_SIDE;
}
if ( (o12 == COLLINEAR)
||(o23 == COLLINEAR)
||(o31 == COLLINEAR) )
{
return ON_ORIENTED_BOUNDARY;
}
else
{
return ON_POSITIVE_SIDE;
}
}
}
template <class R>
inline
bool
TriangleH2<R>::
has_on_positive_side( const PointH2<R>& p) const
{ return ( oriented_side(p) == ON_POSITIVE_SIDE ); }
template <class R>
inline
bool
TriangleH2<R>::has_on_boundary(const PointH2<R>& p) const
{ return oriented_side(p) == ON_ORIENTED_BOUNDARY; }
template <class R>
inline
bool
TriangleH2<R>::
has_on_negative_side( const PointH2<R>& p) const
{ return oriented_side(p) == ON_NEGATIVE_SIDE; }
template <class R>
CGAL_KERNEL_MEDIUM_INLINE
Bounded_side
TriangleH2<R>::bounded_side(const PointH2<R>& p) const
{
CGAL_kernel_precondition( ! is_degenerate() );
Orientation o12 = CGAL::orientation( vertex(1), vertex(2), p);
Orientation o23 = CGAL::orientation( vertex(2), vertex(3), p);
Orientation o31 = CGAL::orientation( vertex(3), vertex(1), p);
Orientation ori = orientation();
Orientation opp = CGAL::opposite( ori);
if ( (o12 == opp) || (o23 == opp) || (o31 == opp) )
{
return ON_UNBOUNDED_SIDE;
}
if ( (o12 == ori) && (o23 == ori) && (o31 == ori) )
{
return ON_BOUNDED_SIDE;
}
return ON_BOUNDARY;
}
template <class R>
CGAL_KERNEL_MEDIUM_INLINE
bool
TriangleH2<R>::has_on_bounded_side(const PointH2<R>& p) const
{
CGAL_kernel_precondition( ! is_degenerate() );
Orientation o12 = CGAL::orientation( vertex(1), vertex(2), p);
Orientation o23 = CGAL::orientation( vertex(2), vertex(3), p);
Orientation o31 = CGAL::orientation( vertex(3), vertex(1), p);
Orientation ori = Ptr()->_orientation;
return ( (o12 == ori) && (o23 == ori) && (o31 == ori) );
}
template <class R>
CGAL_KERNEL_MEDIUM_INLINE
bool
TriangleH2<R>::has_on_unbounded_side(const PointH2<R>& p) const
{
CGAL_kernel_precondition( ! is_degenerate() );
Orientation o12 = CGAL::orientation( vertex(1), vertex(2), p);
Orientation o23 = CGAL::orientation( vertex(2), vertex(3), p);
Orientation o31 = CGAL::orientation( vertex(3), vertex(1), p);
Orientation opp = CGAL::opposite( Ptr()->_orientation );
return ( (o12 == opp) || (o23 == opp) || (o31 == opp) );
}
template <class R>
inline
bool
TriangleH2<R>::is_degenerate() const
{ return (Ptr()->_orientation == COLLINEAR); }
template <class R>
inline
Bbox_2
TriangleH2<R>::bbox() const
{ return vertex(0).bbox() + vertex(1).bbox() + vertex(2).bbox(); }
template <class R>
CGAL_KERNEL_INLINE
TriangleH2<R>
TriangleH2<R>::
transform( const Aff_transformationH2<R>& t) const
{
return TriangleH2<R>(t.transform(Ptr()->A[0]),
t.transform(Ptr()->A[1]),
t.transform(Ptr()->A[2]) );
}
template <class R>
CGAL_KERNEL_INLINE
TriangleH2<R>
TriangleH2<R>::opposite() const
{ return TriangleH2<R>(Ptr()->A[0], Ptr()->A[2], Ptr()->A[1]); }
template <class R>
CGAL_KERNEL_MEDIUM_INLINE
bool
TriangleH2<R>::operator==(const TriangleH2<R>& t) const
{
int j = 0;
while ( (t.vertex(0) != vertex(j)) && (j < 3) ) j++;
if ( j == 3)
{
return false;
}
if ( (t.vertex(1) == vertex(j+1)) && (t.vertex(2) == vertex(j+2)) )
{
return true;
}
return false;
}
template <class R>
inline
bool
TriangleH2<R>::operator!=(const TriangleH2<R>& t) const
{ return !(*this == t); }
#ifndef CGAL_NO_OSTREAM_INSERT_TRIANGLEH2
template < class R >
std::ostream &
operator<<(std::ostream &os, const TriangleH2<R> &t)
{
switch(os.iword(IO::mode))
{
case IO::ASCII :
return os << t[0] << ' ' << t[1] << ' ' << t[2];
case IO::BINARY :
return os << t[0] << t[1] << t[2];
default:
return os<< "TriangleH2(" << t[0] << ", " << t[1] << ", " << t[2] <<")";
}
}
#endif // CGAL_NO_OSTREAM_INSERT_TRIANGLEH2
#ifndef CGAL_NO_ISTREAM_EXTRACT_TRIANGLEH2
template < class R >
std::istream &
operator>>(std::istream &is, TriangleH2<R> &t)
{
PointH2<R> p, q, r;
is >> p >> q >> r;
t = TriangleH2<R>(p, q, r);
return is;
}
#endif // CGAL_NO_ISTREAM_EXTRACT_TRIANGLEH2
#ifdef CGAL_CFG_TYPENAME_BUG
#undef typename
#endif
CGAL_END_NAMESPACE
#endif // CGAL_TRIANGLEH2_H
Reference in New Issue View Git Blame Copy Permalink