Cross Reference: /inkscape/src/2geom/convex-hull.cpp

Lines Matching defs:ConvexHull
62 ConvexHull::ConvexHull(Point const &a, Point const &b)
72 ConvexHull::ConvexHull(Point const &a, Point const &b, Point const &c)
83 ConvexHull::ConvexHull(Point const &a, Point const &b, Point const &c, Point const &d)
95 ConvexHull::ConvexHull(std::vector<Point> const &pts)
107 bool ConvexHull::_is_clockwise_turn(Point const &a, Point const &b, Point const &c)
113 void ConvexHull::_construct()
151 double ConvexHull::area() const
163 OptRect ConvexHull::bounds() const
171 Point ConvexHull::topPoint() const
187 Point ConvexHull::bottomPoint() const
225 bool ConvexHull::contains(Point const &p) const
247 bool ConvexHull::contains(Rect const &r) const
255 bool ConvexHull::contains(ConvexHull const &ch) const
274 void ConvexHull::swap(ConvexHull &other)
280 void ConvexHull::swap(std::vector<Point> &pts)
361 /*** ConvexHull::add_point
365 ConvexHull::merge(Point p) {
403 /*** ConvexHull::is_clockwise
409 ConvexHull::is_clockwise() const {
425 /*** ConvexHull::top_point_first
430 ConvexHull::top_point_first() const {
447 ConvexHull::meets_invariants() const {
451 /*** ConvexHull::is_degenerate
455 ConvexHull::is_degenerate() const {
482 std::vector<pair<int, int> > bridges(ConvexHull a, ConvexHull b) {
532 unsigned find_bottom_right(ConvexHull const &a) {
540 /*** ConvexHull sweepline_intersection(ConvexHull a, ConvexHull b);
546 ConvexHull sweepline_intersection(ConvexHull const &a, ConvexHull const &b) {
547     ConvexHull ret;
566 /*** ConvexHull intersection(ConvexHull a, ConvexHull b);
571 ConvexHull intersection(ConvexHull /*a*/, ConvexHull /*b*/) {
572     ConvexHull ret;
589 /*** ConvexHull merge(ConvexHull a, ConvexHull b);
592 ConvexHull merge(ConvexHull a, ConvexHull b) {
593     ConvexHull ret;
605     ConvexHull chs[2] = {a, b};
626 ConvexHull graham_merge(ConvexHull a, ConvexHull b) {
627     ConvexHull result;
646 ConvexHull andrew_merge(ConvexHull a, ConvexHull b) {
647     ConvexHull result;
669         cc.push_back(ConvexHull((*it).begin(), (*it).end()));
673 double ConvexHull::centroid_and_area(Geom::Point& centroid) const {
697 Point const * ConvexHull::furthest(Point direction) const {
715 double ConvexHull::narrowest_diameter(Point &a, Point &b, Point &c) {