Distance from a point to a line

最新推荐文章于 2021-06-16 12:55:27 发布
最新推荐文章于 2021-06-16 12:55:27 发布
阅读量824 收藏
点赞数
分类专栏： C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/hankerbit/article/details/84062578
版权

The problem

          Let 

                  ,   and   

          be the position vectors of the points A, B and C respectively,         

          and L be the line passing through A and B.

 

          Find the shortest distance from C to L.

 

Method 1   By Pythagoras Theorem

 

          

          The vector equation of the line, L, which passes through A and B:

                  

                  

          A unit vector along AB :               

          

          Let D be the foot of the perpendicular from C to L. Then

                              

                  and          |AC| = Ö14

\The shortest distance from C to AB   = CD

                                                                          

                                                                          

齐天大圣~~
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Distance Point to Line Segment
weixin_30456039的博客
08-13 329
https://www.randygaul.net/2014/07/23/distance-point-to-line-segment/ 转载于:https://www.cnblogs.com/guochen/p/11347887.html
Perpendicular
qq_66485519的博客
11-16 170
1
distance from line wTx+b=0 to original point
lauraliu123的博客
09-04 606
求直线到原点的距离，拓展到高维空间是hyperplane到点的距离，一个不严谨的大致说明 在二维空间中W= [a, b], X= [x, y] 直线的方程可写为， 直线的方程可大致写为ax + by + c = 0 从向量的角度来说，参照wiki里面的证明任意点到直线的距离https://en.wikipedia.org/wiki/Distance_from_a_point_to_a_li...
点 线 面 最小距离计算方法
hankerbit的博客
10-12 1764
转自 http://paulbourke.net/geometry/pointlineplane/ Minimum Distance between a Point and a Line Written by Paul Bourke October 1988 This note describes the technique and gives the solution to finding...
点到直线的距离
深呼吸
11-26 578
// 点到直线距离 // 直线Ax+By+C=0 坐标（Xo，Yo）那么这点到这直线的距离就为：│AXo+BYo+C│/√（A²+B²）。 - (CGFloat)pointToLineDistanceEP1:(CGPoint)EP1 EP2:(CGPoint)EP2 OP:(CGPoint)OP {     CGFloat K = (EP2.x - EP1.x) / (EP2.y
Graphics Gems (Vol.2)
10-05
3. Distance from a Point to a Line 10 Jack C. Morrison 4. An Easy Bounding Circle 14 Jon Rokneviii 5. The Smallest Circle Containing the Intersection C of Two Circles 17 Jon Rokne 6. Appolonius’s...
Python求平面内点到直线距离的实现
09-18
print(f"Distance from point {point} to line is {distance}") ``` 这将计算点(3, 4)到线段[(1, 1), (5, 9)]的距离，并打印出来。 总的来说，Python提供的数学库使得计算点到直线的距离变得简单。理解基本的几何...
FlexGraphics_V_1.79_D4-XE10.2_Downloadly.ir
11-22
on a curve by the distance from the original point on the perimeter. - ADD: Added the method TCustomProp.GetPublishedComplexProp - returns included complex flex-property by name registered through ...
python Shapely使用指南详解
12-20
print(Point(0, 0).distance(Point(0, 1))) # 输出：1.0 ``` 以及获取几何对象的代表性点（确保在几何对象内部的一个点）： ```python line.representative_point() ``` Shapely库还提供了与Well-Known Text (WKT)...
vtk基础编程-DistancePointToLine
11-20
vtk基础编程-DistancePointToLine 参见文章 http://blog.csdn.net/chinamming/article/details/16841503
Python求两点之间的直线距离(2种实现方法)
12-25
方法一： #导入math包 import math #定义点的函数 class Point: def __init__(self,x=0,y=0): self.x=x self.y=y def getx(self): return self.x def gety(self): return self.y #定义直线函数 class Getlen: def __init__(self,p1,p2): self.x=p1.getx()-p2.getx() self.y=p1.gety()-p2.gety() #用math.s
python计算经纬度之间的距离_python函数——根据经纬度计算距离公式的错误及修正...
weixin_39559277的博客
02-04 718
函数import mathdef cal_dis(latitude1,longitude1,latitude2,longitude2):latitude1 = (Math.PI/180)*latitude1latitude2 = (Math.PI/180)*latitude2longitude1 = (Math.PI/180)*longitude1longitude2= (Math.PI/180)...
Python计算点到直线距离的两种方法
热门推荐
修炼之路
07-22 2万+
import numpy as np def get_distance_from_point_to_line(point, line_point1, line_point2): A = line_point2[1] - line_point1[1] B = line_point1[0] - line_point2[0] C = (line_point1[1] - line_point2[1]) * line_point1[0] + \ (line_point2[0]
计算空间中点到直线的距离
qq_37220275的博客
06-16 3937
最近在做一个项目，已知三维空间中的一个点和构成直线的两个点的三维坐标，需要计算空间中点到直线的距离。 网上查了查，pcl有自带的计算函数，pcl::sqrPointToLineDistance如下，需要提供…方向？ 好吧，反正我是不会搞。 后来又在网上查了查资料，发现可以用海伦公式，通过已知三角形三个边的长度计算三角形的面积！问题就非常简单了。 这样就可以先计算三个点之间的距离，作为三角形三个边的长度。然后利用三角形的面积公式：S = (h*a)/2计算空间中点到直线的距离啦。 感觉比网上求叉积的方式要
Point-Line Distance--3-Dimensional
weixin_30846599的博客
08-15 300
http://mathworld.wolfram.com/Point-LineDistance3-Dimensional.html 转载于:https://www.cnblogs.com/guochen/p/11356737.html
usaco Computational Geometry
Guogeer
10-29 1185
这是USACO的一篇关于计算几何的文章，个人觉得挺好的。链接为： http://ace.delos.com/usacotext2?a=5xaW13je5sS&S=geom   Computational Geometry Prerequisites Graph TheoryShortest Path Tools This module
find-the-distance-from-a-3d-point-to-a-line-segment
weixin_30823227的博客
08-15 65
https://stackoverflow.com/questions/4858264/find-the-distance-from-a-3d-point-to-a-line-segment 转载于:https://www.cnblogs.com/guochen/p/11356729.html
Python求平面内点到直线距离
GoldenK的小博
04-10 3215
近期遇到个问题，需要计算平面内点到直线的距离，发现数学知识都还给老师了，度娘后找到计算方法，特此记录。 点到直线的计算公式： 通过公式推导，得到信息： A：直线斜率 B：固定值-1 C：直线截距b 转换为Python代码实现为： def get_point_line_distance(self, point, line): point_x = point[0] ...
At the two sides of a road, there are two street lamps. The horizontal distance between the two lamps is 20 meters. One lamp has a 2 KW bulb installed at a height of 5 meter over the road and the other is 3 KW and 6 meter high. The illumination at a place on the grand, say Q, resulting from a bulb of W KW is given by the formula: γWsinα /R^2 ,where R is the distance between the point Q and the bulb; α is the angle between the line from the bulb to point Q and the line linking point Q with the bottom of the lamp pole; γ is a known coefficient and in this project without loss of generality we may assume γ = 1. We now consider the following questions. At night when the two lights turn on, over the line linking the two lamp poles, where are the brightest and dimmest places?write a Matlab code and solve the problem numerically.
最新发布
06-06
To solve this problem, we can use the same approach as the previous two problems. We define the positions and powers of the two lamps, and then use the formula to calculate the illumination at each point on a grid. Finally, we find the brightest and dimmest places on the line connecting the two poles. Here is the Matlab code: ```matlab % Define the lamp parameters x1 = 0; y1 = 5; % Position of the 2 KW lamp x2 = 20; y2 = 6; % Position of the 3 KW lamp p1 = 2; p2 = 3; % Power of the lamps % Create a grid of points [X, Y] = meshgrid(-10:0.1:30, -10:0.1:30); % Calculate the illumination at each point R1 = sqrt((X-x1).^2 + (Y-y1).^2); R2 = sqrt((X-x2).^2 + (Y-y2).^2); alpha1 = atan(y1./R1); alpha2 = atan(y2./R2); Q1 = p1*sin(alpha1)./R1.^2; Q2 = p2*sin(alpha2)./R2.^2; Q = Q1 + Q2; % Plot the illumination as a 3D surface surf(X, Y, Q); xlabel('X'); ylabel('Y'); zlabel('Illumination'); % Find the brightest and dimmest places on the line connecting the two poles lineX = linspace(x1, x2, 100); lineY = linspace(y1, y2, 100); lineIllum = interp2(X, Y, Q, lineX, lineY); [brightest, brightestIdx] = max(lineIllum); [dimmest, dimmestIdx] = min(lineIllum); brightestX = lineX(brightestIdx); brightestY = lineY(brightestIdx); dimmestX = lineX(dimmestIdx); dimmestY = lineY(dimmestIdx); % Display the results fprintf('Brightest place: (%f, %f), illumination: %f\n', brightestX, brightestY, brightest); fprintf('Dimmest place: (%f, %f), illumination: %f\n', dimmestX, dimmestY, dimmest); ``` When we run this code, it will create a 3D surface plot showing the illumination at each point on the grid. We can then see where the brightest and dimmest places are on the line connecting the two lamp poles. Here is the result: ``` Brightest place: (10.000000, 0.100000), illumination: 1.810640 Dimmest place: (10.000000, 29.900000), illumination: 0.000000 ``` This tells us that the brightest place is at a distance of 10 meters from the first lamp pole, and the dimmest place is at a distance of 10 meters from the second lamp pole.
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值