mirror of https://github.com/CGAL/cgal
335 lines
7.9 KiB
C++
335 lines
7.9 KiB
C++
// ======================================================================
|
|
//
|
|
// Copyright (c) 2000 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 : include/CGAL/Cartesian/Iso_rectangle_2.h
|
|
// revision : $Revision$
|
|
// revision_date : $Date$
|
|
// author(s) : Andreas Fabri, Herve Bronnimann
|
|
// coordinator : INRIA Sophia-Antipolis (Mariette.Yvinec@sophia.inria.fr)
|
|
//
|
|
// ======================================================================
|
|
|
|
#ifndef CGAL_CARTESIAN_ISO_RECTANGLE_2_H
|
|
#define CGAL_CARTESIAN_ISO_RECTANGLE_2_H
|
|
|
|
#include <CGAL/Twotuple.h>
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
|
|
template <class R_>
|
|
class Iso_rectangleC2
|
|
: public R_::template Handle<Twotuple<typename R_::Point_2> >::type
|
|
{
|
|
CGAL_VC7_BUG_PROTECTED
|
|
typedef typename R_::FT FT;
|
|
typedef typename R_::Point_2 Point_2;
|
|
typedef typename R_::Iso_rectangle_2 Iso_rectangle_2;
|
|
typedef typename R_::Aff_transformation_2 Aff_transformation_2;
|
|
|
|
typedef Twotuple<Point_2> rep;
|
|
typedef typename R_::template Handle<rep>::type base;
|
|
|
|
public:
|
|
typedef R_ R;
|
|
|
|
Iso_rectangleC2()
|
|
: base(rep()) {}
|
|
|
|
Iso_rectangleC2(const Point_2 &p, const Point_2 &q)
|
|
{
|
|
FT minx, maxx, miny, maxy;
|
|
if (p.x() < q.x()) { minx = p.x(); maxx = q.x(); }
|
|
else { minx = q.x(); maxx = p.x(); }
|
|
if (p.y() < q.y()) { miny = p.y(); maxy = q.y(); }
|
|
else { miny = q.y(); maxy = p.y(); }
|
|
initialize_with(rep(Point_2(minx, miny),
|
|
Point_2(maxx, maxy)));
|
|
}
|
|
|
|
Iso_rectangleC2(const Point_2 &left, const Point_2 &right,
|
|
const Point_2 &bottom, const Point_2 &top)
|
|
: base(rep(Point_2(left.x(), bottom.y()),
|
|
Point_2(right.x(), top.y())))
|
|
{
|
|
CGAL_kernel_precondition(!less_x(right, left));
|
|
CGAL_kernel_precondition(!less_y(top, bottom));
|
|
}
|
|
|
|
Iso_rectangleC2(const FT& min_x, const FT& min_y,
|
|
const FT& max_x, const FT& max_y)
|
|
: base(rep(Point_2(min_x, min_y),
|
|
Point_2(max_x, max_y)))
|
|
{
|
|
CGAL_kernel_precondition(min_x <= max_x);
|
|
CGAL_kernel_precondition(min_y <= max_y);
|
|
}
|
|
|
|
Iso_rectangleC2(const FT& min_hx, const FT& min_hy,
|
|
const FT& max_hx, const FT& max_hy, const FT& hw)
|
|
{
|
|
if (hw == FT(1))
|
|
initialize_with(rep(Point_2(min_hx, min_hy),
|
|
Point_2(max_hx, max_hy)));
|
|
else
|
|
initialize_with(rep(Point_2(min_hx/hw, min_hy/hw),
|
|
Point_2(max_hx/hw, max_hy/hw)));
|
|
}
|
|
|
|
bool operator==(const Iso_rectangleC2 &s) const;
|
|
bool operator!=(const Iso_rectangleC2 &s) const;
|
|
|
|
const Point_2 & min() const
|
|
{
|
|
return Ptr()->e0;
|
|
}
|
|
const Point_2 & max() const
|
|
{
|
|
return Ptr()->e1;
|
|
}
|
|
Point_2 vertex(int i) const;
|
|
Point_2 operator[](int i) const;
|
|
|
|
Iso_rectangle_2 transform(const Aff_transformation_2 &t) const
|
|
{
|
|
// FIXME : We need a precondition like this!!!
|
|
// CGAL_kernel_precondition(t.is_axis_preserving());
|
|
return Iso_rectangleC2<R>(t.transform(vertex(0)), t.transform(vertex(2)));
|
|
}
|
|
|
|
Bounded_side bounded_side(const Point_2 &p) const;
|
|
bool has_on_boundary(const Point_2 &p) const;
|
|
bool has_on_bounded_side(const Point_2 &p) const;
|
|
bool has_on_unbounded_side(const Point_2 &p) const;
|
|
|
|
bool is_degenerate() const;
|
|
|
|
Bbox_2 bbox() const;
|
|
|
|
const FT & xmin() const;
|
|
const FT & ymin() const;
|
|
const FT & xmax() const;
|
|
const FT & ymax() const;
|
|
const FT & min_coord(int i) const;
|
|
const FT & max_coord(int i) const;
|
|
|
|
FT area() const;
|
|
};
|
|
|
|
template < class R >
|
|
inline
|
|
bool
|
|
Iso_rectangleC2<R>::
|
|
operator==(const Iso_rectangleC2<R> &r) const
|
|
{
|
|
if (identical(r))
|
|
return true;
|
|
return vertex(0) == r.vertex(0) && vertex(2) == r.vertex(2);
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
bool
|
|
Iso_rectangleC2<R>::
|
|
operator!=(const Iso_rectangleC2<R> &r) const
|
|
{
|
|
return !(*this == r);
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename Iso_rectangleC2<R>::FT &
|
|
Iso_rectangleC2<R>::xmin() const
|
|
{
|
|
return min().x();
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename Iso_rectangleC2<R>::FT &
|
|
Iso_rectangleC2<R>::ymin() const
|
|
{
|
|
return min().y();
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename Iso_rectangleC2<R>::FT &
|
|
Iso_rectangleC2<R>::xmax() const
|
|
{
|
|
return max().x();
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename Iso_rectangleC2<R>::FT &
|
|
Iso_rectangleC2<R>::ymax() const
|
|
{
|
|
return max().y();
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename Iso_rectangleC2<R>::FT &
|
|
Iso_rectangleC2<R>::min_coord(int i) const
|
|
{
|
|
CGAL_kernel_precondition( i == 0 || i == 1 );
|
|
if (i == 0)
|
|
return xmin();
|
|
else
|
|
return ymin();
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
const typename Iso_rectangleC2<R>::FT &
|
|
Iso_rectangleC2<R>::max_coord(int i) const
|
|
{
|
|
CGAL_kernel_precondition( i == 0 || i == 1 );
|
|
if (i == 0)
|
|
return xmax();
|
|
else
|
|
return ymax();
|
|
}
|
|
|
|
template < class R >
|
|
typename Iso_rectangleC2<R>::Point_2
|
|
Iso_rectangleC2<R>::vertex(int i) const
|
|
{
|
|
switch (i%4) {
|
|
case 0: return min();
|
|
case 1: return Point_2(xmax(), ymin());
|
|
case 2: return max();
|
|
default: return Point_2(xmin(), ymax());
|
|
}
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
typename Iso_rectangleC2<R>::Point_2
|
|
Iso_rectangleC2<R>::operator[](int i) const
|
|
{
|
|
return vertex(i);
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
typename Iso_rectangleC2<R>::FT
|
|
Iso_rectangleC2<R>::area() const
|
|
{
|
|
return (xmax()-xmin()) * (ymax()-ymin());
|
|
}
|
|
|
|
template < class R >
|
|
CGAL_KERNEL_MEDIUM_INLINE
|
|
Bounded_side
|
|
Iso_rectangleC2<R>::
|
|
bounded_side(const typename Iso_rectangleC2<R>::Point_2 &p) const
|
|
{ // FIXME : predicate
|
|
bool x_incr = (xmin() < p.x()) && (p.x() < xmax()),
|
|
y_incr = (ymin() < p.y()) && (p.y() < ymax());
|
|
if (x_incr)
|
|
{
|
|
if (y_incr)
|
|
return ON_BOUNDED_SIDE;
|
|
if ( (p.y() == ymin()) || (ymax() == p.y()) )
|
|
return ON_BOUNDARY;
|
|
}
|
|
if ( (p.x() == xmin()) || (xmax() == p.x()) )
|
|
if ( y_incr || (p.y() == ymin()) || (ymax() == p.y()) )
|
|
return ON_BOUNDARY;
|
|
|
|
return ON_UNBOUNDED_SIDE;
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
bool
|
|
Iso_rectangleC2<R>::
|
|
has_on_boundary(const typename Iso_rectangleC2<R>::Point_2 &p) const
|
|
{
|
|
return bounded_side(p) == ON_BOUNDARY;
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
bool
|
|
Iso_rectangleC2<R>::
|
|
has_on_bounded_side(const typename Iso_rectangleC2<R>::Point_2 &p)
|
|
const
|
|
{
|
|
return bounded_side(p) == ON_BOUNDED_SIDE;
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
bool
|
|
Iso_rectangleC2<R>::
|
|
has_on_unbounded_side(const typename Iso_rectangleC2<R>::Point_2 &p)
|
|
const
|
|
{
|
|
return bounded_side(p) == ON_UNBOUNDED_SIDE;
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
bool
|
|
Iso_rectangleC2<R>::is_degenerate() const
|
|
{
|
|
return (xmin() == xmax()) || (ymin() == ymax());
|
|
}
|
|
|
|
template < class R >
|
|
inline
|
|
Bbox_2
|
|
Iso_rectangleC2<R>::bbox() const
|
|
{ // FIXME : to_interval
|
|
return Bbox_2(CGAL::to_double(xmin()), CGAL::to_double(ymin()),
|
|
CGAL::to_double(xmax()), CGAL::to_double(ymax()));
|
|
}
|
|
|
|
#ifndef CGAL_NO_OSTREAM_INSERT_ISO_RECTANGLEC2
|
|
template < class R >
|
|
std::ostream &
|
|
operator<<(std::ostream &os, const Iso_rectangleC2<R> &r)
|
|
{
|
|
switch(os.iword(IO::mode)) {
|
|
case IO::ASCII :
|
|
return os << r[0] << ' ' << r[2];
|
|
case IO::BINARY :
|
|
return os << r[0] << r[2];
|
|
default:
|
|
return os << "Iso_rectangleC2(" << r[0] << ", " << r[2] << ")";
|
|
}
|
|
}
|
|
#endif // CGAL_NO_OSTREAM_INSERT_ISO_RECTANGLEC2
|
|
|
|
#ifndef CGAL_NO_ISTREAM_EXTRACT_ISO_RECTANGLEC2
|
|
template < class R >
|
|
CGAL_KERNEL_MEDIUM_INLINE
|
|
std::istream &
|
|
operator>>(std::istream &is, Iso_rectangleC2<R> &r)
|
|
{
|
|
typename R::Point_2 p, q;
|
|
|
|
is >> p >> q;
|
|
|
|
if (is)
|
|
r = Iso_rectangleC2<R>(p, q);
|
|
return is;
|
|
}
|
|
#endif // CGAL_NO_ISTREAM_EXTRACT_ISO_RECTANGLEC2
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#endif // CGAL_CARTESIAN_ISO_RECTANGLE_2_H
|