mirror of https://github.com/CGAL/cgal
"Return `true`"
This commit is contained in:
parent
f38c886c8b
commit
dfb64ce2f1
|
|
@ -216,12 +216,12 @@ private:
|
||||||
const Curve_segment_index& curve_index,
|
const Curve_segment_index& curve_index,
|
||||||
ErasedVeOutIt out);
|
ErasedVeOutIt out);
|
||||||
|
|
||||||
/// Returns true if balls of \c va and \c vb intersect, and (va,vb) is not
|
/// Returns `true` if balls of \c va and \c vb intersect, and (va,vb) is not
|
||||||
/// an edge of the complex
|
/// an edge of the complex
|
||||||
bool non_adjacent_but_intersect(const Vertex_handle& va,
|
bool non_adjacent_but_intersect(const Vertex_handle& va,
|
||||||
const Vertex_handle& vb) const;
|
const Vertex_handle& vb) const;
|
||||||
|
|
||||||
/// Returns true if balls of \c va and \c vb intersect
|
/// Returns `true` if balls of \c va and \c vb intersect
|
||||||
bool do_balls_intersect(const Vertex_handle& va,
|
bool do_balls_intersect(const Vertex_handle& va,
|
||||||
const Vertex_handle& vb) const;
|
const Vertex_handle& vb) const;
|
||||||
|
|
||||||
|
|
@ -230,7 +230,7 @@ private:
|
||||||
const bool special_ball = false);
|
const bool special_ball = false);
|
||||||
|
|
||||||
|
|
||||||
/// Returns true if balls of v1 and v2 intersect "enough".
|
/// Returns `true` if balls of v1 and v2 intersect "enough".
|
||||||
/// \param orientation Orientation of the curve segment between \c v1 and
|
/// \param orientation Orientation of the curve segment between \c v1 and
|
||||||
/// \c v2, given the orientation of the curve of index
|
/// \c v2, given the orientation of the curve of index
|
||||||
/// \c curve_index
|
/// \c curve_index
|
||||||
|
|
@ -325,7 +325,7 @@ private:
|
||||||
ErasedVeOutIt
|
ErasedVeOutIt
|
||||||
repopulate_edges_around_corner(const Vertex_handle& v, ErasedVeOutIt out);
|
repopulate_edges_around_corner(const Vertex_handle& v, ErasedVeOutIt out);
|
||||||
|
|
||||||
/// Returns true if edge with index \c curve_index is already treated
|
/// Returns `true` if edge with index \c curve_index is already treated
|
||||||
bool is_treated(const Curve_segment_index& curve_index) const
|
bool is_treated(const Curve_segment_index& curve_index) const
|
||||||
{
|
{
|
||||||
return ( treated_edges_.find(curve_index) != treated_edges_.end() );
|
return ( treated_edges_.find(curve_index) != treated_edges_.end() );
|
||||||
|
|
|
||||||
|
|
@ -92,13 +92,13 @@ public:
|
||||||
return points_.back();
|
return points_.back();
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Returns true if the polyline is not degenerated
|
/// Returns `true` if the polyline is not degenerated
|
||||||
bool is_valid() const
|
bool is_valid() const
|
||||||
{
|
{
|
||||||
return points_.size() > 1;
|
return points_.size() > 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Returns true if polyline is a cycle
|
/// Returns `true` if polyline is a cycle
|
||||||
bool is_cycle() const
|
bool is_cycle() const
|
||||||
{
|
{
|
||||||
return start_point() == end_point();
|
return start_point() == end_point();
|
||||||
|
|
@ -644,10 +644,10 @@ public:
|
||||||
CGAL::Sign distance_sign(const Point_3& p, const Point_3& q,
|
CGAL::Sign distance_sign(const Point_3& p, const Point_3& q,
|
||||||
const Curve_segment_index& index) const;
|
const Curve_segment_index& index) const;
|
||||||
|
|
||||||
/// Returns true if curve \c curve_index is a cycle
|
/// Returns `true` if curve \c curve_index is a cycle
|
||||||
bool is_cycle(const Point_3&, const Curve_segment_index& index) const;
|
bool is_cycle(const Point_3&, const Curve_segment_index& index) const;
|
||||||
|
|
||||||
/// Returns true if the portion of the curve segment of index \c index,
|
/// Returns `true` if the portion of the curve segment of index \c index,
|
||||||
/// between the points \c c1 and \c c2, is covered by the spheres of
|
/// between the points \c c1 and \c c2, is covered by the spheres of
|
||||||
/// centers \c c1 and \c c2 and squared radii \c sq_r1 and \c sq_r2
|
/// centers \c c1 and \c c2 and squared radii \c sq_r1 and \c sq_r2
|
||||||
/// respectively.
|
/// respectively.
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue