Distance between two points

心已赠人 2022-01-06 09:11 110阅读 0赞

This small operation calcuates the distance between two points. The routine can work in any number of dimensions, so you cold apply it to 2D or 3D.

In 2D  
Define your two points. Point 1 at (x1, y1) and Point 2 at (x2, y2).

xd = x2-x1
    	yd = y2-y1
    	Distance = SquareRoot(xd*xd + yd*yd)

In 3D  
Define your two points. Point 1 at (x1, y1, z1) and Point 2 at (x2, y2, z2).

xd = x2-x1
    	yd = y2-y1
    	zd = z2-z1
    	Distance = SquareRoot(xd*xd + yd*yd + zd*zd)

As you can see, this requires that you perform a square root. Square roots should be avoided like the plague if you want to write fast code. Only perform a Square Root if you really need to.

Ways to avoid Square Roots:

If you don't need a very accurate distance, you can use a lookup table to calculate it.  
If, for example, you are performing collision detection between spheres, and all you want to know is whether or not two have collided, then you do not need to use a square root. Simply change the piece of code from:

if SquareRoot(xd*xd + yd*yd) < Diameter

to:

if (xd*xd + yd*yd) < (Diameter*Diameter)

转载于:https://www.cnblogs.com/chriscai/archive/2009/11/14/1602956.html

发表评论取消回复

表情：

评论列表（有 0 条评论，110人围观）

还没有评论，来说两句吧...

相关阅读

相关 LeetCode（Binary Search Tree)783. Minimum Distance Between BST Nodes

1.问题 Given the root of a Binary Search Tree (BST), return the minimum difference betw

朴灿烈づ我的快乐病毒、/ 2023年09月26日 20:39/ 0 赞/ 13 阅读

相关 LeetCode（Binary Search)1385. Find the Distance Value Between Two Arrays

1.问题 Given two integer arrays arr1 and arr2, and the integer d, return the distance v

水深无声/ 2023年09月25日 23:08/ 0 赞/ 55 阅读

相关 LeetCode | 1385. Find the Distance Value Between Two Arrays两个数组间的距离值【Python】

> LeetCode 1385. Find the Distance Value Between Two Arrays两个数组间的距离值【Easy】【Python】【暴力】

客官°小女子只卖身不卖艺/ 2023年07月17日 14:10/ 0 赞/ 14 阅读

相关 Widest Vertical Area Between Two Points Containing No Points（C++两点之间不包含任何点的最宽垂直面积）

解题思路：（1）按照横坐标排序，依次计算相邻横坐标的差 class Solution { public: int maxWidthOfVe

╰半橙微兮°/ 2022年12月29日 14:12/ 0 赞/ 159 阅读

相关 LeetCode - Easy - 783. Minimum Distance Between BST Nodes

Topic Tree Depth-first Search Recursion Description [https://leetcode.co

怼烎@/ 2022年10月06日 08:53/ 0 赞/ 114 阅读

相关【Leetcode】【python】Hamming Distance, Merge Two Binary Trees

Hamming Distance 题目大意两个整数的汉明距离是指其二进制不相等的位的个数。给定两个整数x和y，计算汉明距离。注意： 0 ≤ x,

谁借莪１个温暖的怀抱￠/ 2022年06月13日 05:44/ 0 赞/ 117 阅读

相关【LeetCode】783. Minimum Distance Between BST Nodes

Given a Binary Search Tree (BST) with the root node `root`, return the minimum differenc

电玩女神/ 2022年05月18日 09:26/ 0 赞/ 121 阅读

相关 Distance between two points

This small operation calcuates the distance between two points. The routine can work in

心已赠人/ 2022年01月06日 09:11/ 0 赞/ 111 阅读

相关 Point-Line Distance--3-Dimensional

[http://mathworld.wolfram.com/Point-LineDistance3-Dimensional.html][http_mathworld.wolfr

小咪咪/ 2021年10月23日 06:35/ 0 赞/ 338 阅读

相关 PAT A1048 二分/two points

![clipboard.png][] 简单的一道题，想到的有两种方法方法一：二分查找；由于是两个数和，所以我们从i=1开始枚举，在剩下的i+1~n序列中找到m-a

小灰灰/ 2021年09月18日 12:16/ 0 赞/ 162 阅读