Opencv(C++)笔记--cv::pointPolygonTest()判断点的位置

目录

1--cv::pointPolygonTest()用途

2--OpenCV API

3--代码实例


1--cv::pointPolygonTest()用途

        判断当前位置的点在多边形轮廓的相对位置,即内部、边缘和外部;

2--OpenCV API

double cv::pointPolygonTest(cv::InputArray contour, cv::Point2f pt, bool measureDist)

        measureDist = flase时,内部返回+1,边缘返回0,外部返回-1;

        measureDist = true时,返回的是有符号的距离;

3--代码实例

# include <opencv2/opencv.hpp>
# include <cstdio>
# include <iostream>
# include <math.h>

int main(int argc, char** argv){
    const int r = 100;
    cv::Mat src = cv::Mat::zeros(r * 4, r * 4, CV_8UC1);

    // 定义六边形的六个点
    std::vector<cv::Point2f> vert(6);
    vert[0] = cv::Point(3 * r / 2, static_cast<int>(1.34 * r));
    vert[1] = cv::Point(1 * r, 2 * r);
    vert[2] = cv::Point(3 * r / 2, static_cast<int>(2.866 * r));
    vert[3] = cv::Point(5 * r / 2, static_cast<int>(2.866 * r));
    vert[4] = cv::Point(3 * r, 2 * r);
    vert[5] = cv::Point(5 * r / 2, static_cast<int>(1.34 * r));
    // 绘制六边形
    for(int i = 0; i < 6; i++){
        cv::line(src, vert[i], vert[(i + 1) % 6], cv::Scalar(255, 255, 255), 3, 8, 0);
    }

    std::vector<std::vector<cv::Point>> contours;
    std::vector<cv::Vec4i> hierachy;
    cv::Mat csrc;
    src.copyTo(csrc);
    cv::findContours(csrc, contours, hierachy, cv::RETR_TREE, cv::CHAIN_APPROX_SIMPLE, cv::Point(0, 0)); // 检测轮廓
    cv::Mat raw_dist = cv::Mat::zeros(csrc.size(), CV_32FC1);
    for (int row = 0; row < raw_dist.rows; row++){
        for (int col = 0; col < raw_dist.cols; col++){
            // measureDist = flase时,内部返回+1,边缘返回0,外部返回-1
            // measureDist = true时,返回的是有符号的距离
            double dist = cv::pointPolygonTest(contours[0], cv::Point2f(static_cast<float>(col), static_cast<float>(row)), true);
            raw_dist.at<float>(row, col) = static_cast<float>(dist);
        }
    }

    double minValue, maxValue;
    cv::minMaxLoc(raw_dist, &minValue, &maxValue, 0, 0, cv::Mat());
    cv::Mat drawImg = cv::Mat::zeros(src.size(), CV_8UC3);
    for (int row = 0; row < drawImg.rows; row++){
        for (int col = 0; col < drawImg.cols; col++){
            float dist = raw_dist.at<float>(row, col);
            if (dist > 0){ // 当前坐标在内部
                drawImg.at<cv::Vec3b>(row, col)[0] = (uchar)(abs((dist / maxValue)) * 255);
            }
            else if (dist < 0){ // 当前坐标在外部
                drawImg.at<cv::Vec3b>(row, col)[2] = (uchar)(abs(dist / minValue) * 255);
            }
            else {
                drawImg.at<cv::Vec3b>(row, col)[0] = (uchar)(abs(255 - dist));
                drawImg.at<cv::Vec3b>(row, col)[1] = (uchar)(abs(255 - dist));
                drawImg.at<cv::Vec3b>(row, col)[2] = (uchar)(abs(255 - dist));
            }
        }
    }
    cv::imshow("src", src);
    cv::imshow("test", drawImg);

    cv::waitKey(0);
    return 0;
}

  • 2
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值