信息学奥赛一本通 1034：计算三角形面积 | OpenJudge NOI 1.3 17

【题目链接】

ybt 1034：计算三角形面积
OpenJudge NOI 1.3 17:计算三角形面积

【题目考点】

1. 已知三点求三角形面积公式

已知三点分别为$(x_1,y_1),(x_2,y_2),(x_3,y_3)$
先给出结论：这三个点围成的三角形的面积为：
$S=\frac{1}{2}|x_1{y}_2+x_2{y}_3+x_3{y}_1-x_1{y}_3-x_2{y}_1-x_3{y}_2|$

推导过程：

• 记$\vec{a}=(x_2-x_1,y_2-y_1),\vec{b}=(x_3-x_1,y_3-y_1)$
• 已知向量点积公式$\vec{a}\cdot \vec{b}=|\vec{a}||\vec{b}|cos\theta$，其中$\theta$是向量$\vec{a},\vec{b}$的夹角。
  有$cos\theta =\frac{\vec{a}\cdot \vec{b}}{|\vec{a}||\vec{b}|}$
• 已知$si{n}^2\theta +co{s}^2\theta =1$，且$\theta <\pi$
  有$sin\theta =\sqrt{1-con{s}^2\theta }=\frac{\sqrt{(|\vec{a}||\vec{b}|{)}^2-(\vec{a}\cdot \vec{b}{)}^2}}{|\vec{a}||\vec{b}|}$
• 已知三角形面积公式:$S=\frac{1}{2}|\vec{a}||\vec{b}|sin\theta$
  有$$\begin{array}{rl}S& =\frac{1}{2}|\vec{a}||\vec{b}|\frac{\sqrt{(|\vec{a}||\vec{b}|{)}^2-(\vec{a}\cdot \vec{b}{)}^2}}{|\vec{a}||\vec{b}|}\\ & =\frac{1}{2}\sqrt{(|\vec{a}||\vec{b}|{)}^2-(\vec{a}\cdot \vec{b}{)}^2}\end{array}$$
• $|\vec{a}|=\sqrt{(x_2-x_1{)}^2+(y_2-y_1{)}^2}$
  $|\vec{b}|=\sqrt{(x_3-x_1{)}^2+(y_3-y_1{)}^2}$
  $\vec{a}\cdot \vec{b}=(x_2-x_1)(x_3-x_1)+(y_2-y_1)(y_3-y_1)$
• 根据以上公式：$S=\frac{1}{2}\sqrt{(|\vec{a}||\vec{b}|{)}^2-(\vec{a}\cdot \vec{b}{)}^2}$
  已经可以做到输入$x_1,y_1,x_2,y_2,x_3,y_3$，求S。
  继续化归：
  设$x_{21}=x_2-x_1，x_{31}=x_3-x_1，y_{21}=y_2-y_1，y_{31}=y_3-y_1$，
  $|\vec{a}|=\sqrt{(x_2-x_1{)}^2+(y_2-y_1{)}^2}=\sqrt{x_{21}^2+y_{21}^2}$
  $|\vec{b}|=\sqrt{(x_3-x_1{)}^2+(y_3-y_1{)}^2}=\sqrt{x_{32}^2+y_{32}^2}$
  $$\begin{gathered} (|\vec{a}||\vec{b}|{)}^2=(\sqrt{x_{21}^2+y_{21}^2}\cdot \sqrt{x_{31}^2+y_{31}^2}{)}^2=(x_{21}^2+y_{21}^2)(x_{31}^2+y_{31}^2) \\ =x_{21}^2{x}_{31}^2+x_{21}^2{y}_{31}^2+y_{21}^2{x}_{31}^2+y_{21}^2{y}_{31}^2 \end{gathered}$$
  $$\begin{gathered} (\vec{a}\cdot \vec{b}{)}^2=(x_{21}{x}_{31}+y_{21}{y}_{31}{)}^2 \\ =x_{21}^2{x}_{31}^2+y_{21}^2{y}_{31}^2+2x_{21}{x}_{31}{y}_{21}{y}_{31} \end{gathered}$$
  $(|\vec{a}||\vec{b}|{)}^2-(\vec{a}\cdot \vec{b}{)}^2=x_{21}^2{y}_{31}^2+y_{21}^2{x}_{31}^2-2x_{21}{x}_{31}{y}_{21}{y}_{31}=(x_{21}{y}_{31}-y_{21}{x}_{31}{)}^2$
  $$\begin{gathered} S=\frac{1}{2}\sqrt{(|\vec{a}||\vec{b}|{)}^2-(\vec{a}\cdot \vec{b}{)}^2} \\ =\frac{1}{2}\sqrt{(x_{21}{y}_{31}-y_{21}{x}_{31}{)}^2} \\ =\frac{1}{2}|x_{21}{y}_{31}-y_{21}{x}_{31}| \end{gathered}$$

因此三角形面积S可以表示为：
$$\begin{gathered} S=\frac{1}{2}|(x_2-x_1)(y_3-y_1)-(x_3-x_1)(y_2-y_1)| \\ S=\frac{1}{2}|x_1{y}_2+x_2{y}_3+x_3{y}_1-x_1{y}_3-x_2{y}_1-x_3{y}_2| \\ S=\frac{1}{2}|x_1(y_2-y_3)+x_2(y_3-y_1)+x_3(y_1-y_2)| \end{gathered}$$

2. 海伦公式：已知三条边的长度求三角形面积

设$a=|\vec{a}|,b=|\vec{b}|,c=|\vec{c}|$，
已知$\vec{a}=(x_2-x_1,y_2-y_1),\vec{b}=(x_3-x_1,y_3-y_1),\vec{c}=(x_3-x_2,y_3-y_2)$
有：

• $a=|\vec{a}|=\sqrt{(x_2-x_1{)}^2+(y_2-y_1{)}^2}$
  $b=|\vec{b}|=\sqrt{(x_3-x_1{)}^2+(y_3-y_1{)}^2}$
  $c=|\vec{c}|=\sqrt{(x_3-x_2{)}^2+(y_3-y_2{)}^2}$
• 半周长$p=\frac{1}{2}(a+b+c)$
• 海伦公式，三角形面积$S=\sqrt{p(p-a)(p-b)(p-c)}$

3. 求一个数的绝对值

• 求整数的绝对值：int abs(int a);
• 求浮点型数的绝对值：double fabs(double a);

【题解代码】

解法1：用公式$S=\frac{1}{2}\sqrt{(|\vec{a}||\vec{b}|{)}^2-(\vec{a}\cdot \vec{b}{)}^2}$

#include <bits/stdc++.h>
using namespace std;
int main()
{
	double x1,y1,x2,y2,x3,y3,a_m,b_m,adotb,res;
	cin>>x1>>y1>>x2>>y2>>x3>>y3;
	a_m = sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));//|a|
	b_m = sqrt((x3-x1)*(x3-x1) + (y3-y1)*(y3-y1));//|b|
	adotb = (x2-x1)*(x3-x1)+(y2-y1)*(y3-y1);//a点乘b 
	res = 0.5 * sqrt(a_m*b_m*a_m*b_m-adotb*adotb);//结果 
	cout<<fixed<<setprecision(2)<<res<<endl;
	return 0;
}

解法2：用公式$S=\frac{1}{2}|x_1{y}_2+x_2{y}_3+x_3{y}_1-x_1{y}_3-x_2{y}_1-x_3{y}_2|$

#include <bits/stdc++.h>
using namespace std;
int main()
{
	double x1,y1,x2,y2,x3,y3;
	cin>>x1>>y1>>x2>>y2>>x3>>y3;
	cout<<fixed<<setprecision(2)<<fabs((x1*y2+x2*y3+x3*y1-x1*y3-x2*y1-x3*y2))/2;
	return 0;
}

解法3：用海伦公式$S=\sqrt{p(p-a)(p-b)(p-c)}$

#include <bits/stdc++.h>
using namespace std;
int main()
{
	double x1,y1,x2,y2,x3,y3,a,b,c,p;
	cin>>x1>>y1>>x2>>y2>>x3>>y3;
	a = sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1));//|a|
	b = sqrt((x3-x1)*(x3-x1) + (y3-y1)*(y3-y1));//|b|
	c = sqrt((x3-x2)*(x3-x2) + (y3-y2)*(y3-y2));//|c|
	p = (a + b + c)/2;//p半周长 
	cout<<fixed<<setprecision(2)<<sqrt(p*(p-a)*(p-b)*(p-c))<<endl;
	return 0;
}