ON_POSITIVE_SIDE : ON_NEGATIVE_SIDE;// bs == ON_UNBOUNDED_SIDEreturn (ot == LEFT_TURN) ? ON_NEGATIVE_SIDE : ON_POSITIVE_SIDE;}template <class Gt, class Tds >Bounded_sideTriangulation_2<Gt, Tds>::bounded_side(const Point &p0, const Point &p1,...
if (cutter.has_on_negative_side(support_.point())) bound_state_ = LINE_EMPTY; break; case Line_2_Line_2_pair<K>::LINE: break; case Line_2_Line_2_pair<K>::POINT: typename K::Point_2 ispoint = pair.intersection_point();
Lines (Kernel::Line_2,Kernel::Line_3) in CGAL are oriented. In two-dimensional space, they induce a partition of the plane into a positive side and a negative side. Any two points on a line induce an orientation of this line. A ray (Kernel::Ray_2,Kernel::Ray_3) is semi-infinite...
two based on the Cartesian representation of points and one based on the homogeneous representation of points. The interface of the kernel objects is designed such that it works well with both Cartesian and homogeneous representation, for example, points have a constructor with a range of coordinate...
There might be no feasible solution at all, in which case the quadratic program isinfeasible, or there might be feasible solutions of arbitrarily small objective function value, in which case the program isunbounded. 本包使你能够解决凸二次规划(convex quadratic programs)的通用形式: ...
* EQUAL if p lies on the arc.*/Comparison_result point_position (const Point_2& p) const{// Make sure that p is in the x-range of the arc and check whether it// has the same x-coordinate as one of the endpoints.CGAL_precondition (is_continuous());...
// returns :// ON_BOUNDED_SIDE if p lies strictly inside the tetrahedron// ON_BOUNDARY if p lies on one of the facets// ON_UNBOUNDED_SIDE if p lies strictly outside the tetrahedron{CGAL_triangulation_precondition( orientation(p0,p1,p2,p3) == POSITIVE );...