Toggle navigation
MeasureThat
.net
Create a benchmark
Tools
Feedback
FAQ
Register
Log In
Run results for:
Euclidean distance comparison
A demonstration of efficient and inefficient eculidean distance comparisons
Go to the benchmark
Embed
Embed Benchmark Result
<iframe src="https://measurethat.net/Embed?id=576774" width="100%" height="500px"></iframe>
Run details:
User agent:
Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:133.0) Gecko/20100101 Firefox/133.0
Browser:
Firefox 133
Operating system:
Windows
Device Platform:
Desktop
Date tested:
one year ago
Simple
1857.7M/s
Squared comparator
1638.0M/s
View exact numbers
Test name
Executions per second
✓
Simple
1,857,689,984 Ops/sec
Squared comparator
1,638,046,720 Ops/sec
Script Preparation code:
pointA = { x: 1, y: 2}; pointB = { x: 10, y: 5}; maxDistance = 4;
Tests:
Simple
Math.sqrt(Math.pow(pointA.x - pointB.x, 2) + Math.pow(pointA.y - pointB.y, 2)) < maxDistance
Squared comparator
(Math.pow(pointA.x - pointB.x, 2) + Math.pow(pointA.y - pointB.y, 2)) < Math.pow(maxDistance, 2)