点(x3,y3)到经过点(x1,y1)和点(x2,y2)的直线的最短距离
2015-08-07 11:18
555 查看
/// <summary>
/// 点(x3,y3)到经过点(x1,y1)和点(x2,y2)的直线的最短距离
/// </summary>
/// <param name="pt1"></param>
/// <param name="pt2"></param>
/// <param name="pt3"></param>
/// <returns></returns>
public static double GetMinDistance(MapPoint pt1, MapPoint pt2, MapPoint pt3)
{
double dis = 0;
if (pt1.X == pt2.X)
{
dis = Math.Abs(pt3.X - pt1.X);
return dis;
}
double lineK = (pt2.Y - pt1.Y) / (pt2.X - pt1.X);
double lineC = (pt2.X * pt1.Y - pt1.X * pt2.Y) / (pt2.X - pt1.X);
dis = Math.Abs(lineK * pt3.X - pt3.Y + lineC) / (Math.Sqrt(lineK * lineK + 1));
return dis;
}
/// 点(x3,y3)到经过点(x1,y1)和点(x2,y2)的直线的最短距离
/// </summary>
/// <param name="pt1"></param>
/// <param name="pt2"></param>
/// <param name="pt3"></param>
/// <returns></returns>
public static double GetMinDistance(MapPoint pt1, MapPoint pt2, MapPoint pt3)
{
double dis = 0;
if (pt1.X == pt2.X)
{
dis = Math.Abs(pt3.X - pt1.X);
return dis;
}
double lineK = (pt2.Y - pt1.Y) / (pt2.X - pt1.X);
double lineC = (pt2.X * pt1.Y - pt1.X * pt2.Y) / (pt2.X - pt1.X);
dis = Math.Abs(lineK * pt3.X - pt3.Y + lineC) / (Math.Sqrt(lineK * lineK + 1));
return dis;
}
相关文章推荐
- 【Java】-BigInteger大数类的使用【超强Java大数模板 总结】
- Panel 绘图
- 打印输出九九乘法表
- 35dir无法获取网站缩略图解决办法
- android 5.0新特性学习总结之下拉刷新(一)
- Jsp的request
- UVALive 5881 Unique Encryption Keys
- 40. Element getAttribute() 方法
- Hadoop yarn调试
- hdoj 1686 Oulipo
- Android LayoutInflater详解
- linux sdio card睡眠治疗 sdio card removed解决方案
- at/atq/atrm
- Oulipo
- 浅谈JavaScript 的执行顺序
- MySQL数据库表名、列名、别名区分大小写的问题及解决
- Android虚拟机访问tomcat服务器下的文件
- QT 总结(二) Qt Creator应用程序发布及修改应用程序图标的方法
- Project前面有红色感叹号
- ios xcode 下 报出 ”xx“is missing from working copy 的问题