side = bounded_side(v0->point(), v1->point(), v2->point(),v->point());if( side == ON_UNBOUNDED_SIDE || (side == ON_BOUNDARY && orientation(v0->point(),v->point(),v2->point()) == COLLINEAR &&collinear_between(v0->point(),v->point(),v2->point()) )) {...
Almost all the kernel objects (and the corresponding functions) are templates with a parameter that allows the user to choose the representation of the kernel objects. A type that is used as an argument for this parameter must fulfill certain requirements on syntax and semantics. The list of re...
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();
since the additional coordinate can serve as a common denominator. Avoiding divisions can be useful for exact geometric computation. WithHomogeneous<RingNumberType>you can choose a homogeneous representation for the coordinates of the kernel objects. As for the Cartesian representation, one has to decla...
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)的通用形式: ...
{// The y-coodinate is unbounded, but we can set its sign._ps = Point_2 (x_s, 0);std::pair<CGAL::Sign, CGAL::Sign> signs = _analyze_near_pole (x_s);const CGAL::Sign sign_s = (dir_right ? signs.second : signs.first);...
// 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 );Orientation o0,o1,o2,o3;if ( ((o0 = orientation(p,p1,p2,p3)) == NEGATIVE) ||...