【无标题】

C++凸边形面积

输入:
5
1 0
2 1
2 2
0 2
0 1
输出:
3

给出平面上N个点(按时针方向给出)
求凸边形面积

#include <iostream>
#include <vector>
#include <cmath> 
using namespace std;

float molen(pair<float, float> p){// 向量模长 
	return sqrt(p.first * p.first + p.second*p.second);
}

float calcCos(pair<float, float> x, pair<float, float> y){// 向量夹角余弦值 
	float res = (x.first*y.first + x.second*y.second)/(molen(x)*molen(y));
	cout << "cos: " << res << " ";
	return res;
}

float calcSin(float x){// 余弦值算正弦值 
	return sqrt(1 - x*x);
}

float calcS(pair<float, float> x, pair<float, float> y){
	float sin_val = calcSin(calcCos(x, y));
	cout << "sin: " << sin_val << " ";
	float s = 0.5*sin_val*molen(x)*molen(y);
	cout << "s: " << s << endl;
	return s;
}

void run(){
    int N;
    cout << "输出凸边形点数: ";
    cin >> N;
    vector<pair<float, float>> v;// 用pair存放点 
    for(int i = 0; i < N; i++){
		pair<float, float> p;
		float m, n;
		cin >> p.first >> p.second;
		v.push_back(p);
	}
	
// 打印输入的点 
//	for(auto e : v) cout << e.first << " " << e.second << " " << endl;
//	cout << endl;
	
	// 计算向量, 以第一个点为原点 
	auto meta = v.begin();// 
	auto it = v.begin() + 1;
	vector<pair<float, float>> vecs;
	while(it != v.end()){ 
		pair<float, float> vec;
		vec.first = it->first - meta->first;
		vec.second = it->second - meta->second;
		vecs.push_back(vec);
		it++;
	}
	
	
	cout << "向量: " << endl; 
	for(auto e : vecs){
		cout << e.first << " " << e.second << " " << endl;
	}
	
	auto p = vecs.begin();
	auto q = p + 1;
	float s = 0;
	while(q!=vecs.end()){
		s += calcS(*p, *q);
		p++;
		q++;
	}
	cout << "面积: " << s << endl; 
}

int main(){
	run();
}