mirror of https://github.com/CGAL/cgal
*** empty log message ***
This commit is contained in:
parent
9ff36dfa8f
commit
7eb3869103
|
|
@ -282,12 +282,12 @@ struct Staircases : public Loc_domain< Traits_ > {
|
||||||
Citerator i = this->pts.begin();
|
Citerator i = this->pts.begin();
|
||||||
FT rr = FT(2) * this->r;
|
FT rr = FT(2) * this->r;
|
||||||
do
|
do
|
||||||
if (traits.signed_x_distance_2_object()(this->maxx, *i) > rr &&
|
if (this->traits.signed_x_distance_2_object()(this->maxx, *i) > rr &&
|
||||||
traits.signed_x_distance_2_object()(*i, this->minx) > rr &&
|
this->traits.signed_x_distance_2_object()(*i, this->minx) > rr &&
|
||||||
traits.signed_y_distance_2_object()(*i, this->miny) > rr &&
|
this->traits.signed_y_distance_2_object()(*i, this->miny) > rr &&
|
||||||
traits.signed_y_distance_2_object()(this->maxy, *i) > rr)
|
this->traits.signed_y_distance_2_object()(this->maxy, *i) > rr)
|
||||||
return false;
|
return false;
|
||||||
while (++i != pts.end());
|
while (++i != this->pts.end());
|
||||||
return true;
|
return true;
|
||||||
} // is_middle()
|
} // is_middle()
|
||||||
|
|
||||||
|
|
@ -330,10 +330,10 @@ struct Staircases : public Loc_domain< Traits_ > {
|
||||||
|
|
||||||
Intervall bottom_intervall() const {
|
Intervall bottom_intervall() const {
|
||||||
Point_2 p =
|
Point_2 p =
|
||||||
traits.construct_point_2_below_right_implicit_point_2_object()(
|
this->traits.construct_point_2_below_right_implicit_point_2_object()(
|
||||||
this->minx, this->maxy, FT(2) * this->r);
|
this->minx, this->maxy, FT(2) * this->r);
|
||||||
Point_2 q =
|
Point_2 q =
|
||||||
traits.construct_point_2_below_left_implicit_point_2_object()(
|
this->traits.construct_point_2_below_left_implicit_point_2_object()(
|
||||||
this->maxx, this->maxy, FT(2) * this->r);
|
this->maxx, this->maxy, FT(2) * this->r);
|
||||||
|
|
||||||
Citerator i =
|
Citerator i =
|
||||||
|
|
@ -375,7 +375,7 @@ struct Staircases : public Loc_domain< Traits_ > {
|
||||||
this->traits.less_y_2_object(),
|
this->traits.less_y_2_object(),
|
||||||
compose_shared(std::logical_and< bool >(),
|
compose_shared(std::logical_and< bool >(),
|
||||||
bind_2(this->traits.less_x_2_object(), q),
|
bind_2(this->traits.less_x_2_object(), q),
|
||||||
bind_2(tthis->raits.less_y_2_object(), q)));
|
bind_2(this->raits.less_y_2_object(), q)));
|
||||||
return Intervall(i == this->pts.end() ? this->maxy : *i,
|
return Intervall(i == this->pts.end() ? this->maxy : *i,
|
||||||
j == this->pts.end() ? this->miny : *j);
|
j == this->pts.end() ? this->miny : *j);
|
||||||
} // left_intervall()
|
} // left_intervall()
|
||||||
|
|
@ -385,7 +385,7 @@ struct Staircases : public Loc_domain< Traits_ > {
|
||||||
this->traits.construct_point_2_above_right_implicit_point_2_object()(
|
this->traits.construct_point_2_above_right_implicit_point_2_object()(
|
||||||
this->minx, this->miny, FT(2) * this->r);
|
this->minx, this->miny, FT(2) * this->r);
|
||||||
Point_2 q =
|
Point_2 q =
|
||||||
traits.construct_point_2_below_right_implicit_point_2_object()(
|
this->traits.construct_point_2_below_right_implicit_point_2_object()(
|
||||||
this->minx, this->maxy, FT(2) * this->r);
|
this->minx, this->maxy, FT(2) * this->r);
|
||||||
|
|
||||||
Citerator i =
|
Citerator i =
|
||||||
|
|
|
||||||
|
|
@ -1 +1 @@
|
||||||
1.57 (05 May 2003)
|
1.58 (05 May 2003)
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue