Triangulation algorithms to find your location

Algorithms.Tests/Other/TriangulatorTests.cs

@@ -0,0 +1,62 @@
+using Algorithms.Other;
+using NUnit.Framework;
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+using System.Threading.Tasks;
+
+namespace Algorithms.Tests.Other
+{
+    [TestFixture]
+    public class TriangulatorTests
+    {
+        [Test]
+        public void CalculatePosition_ValidCoordinatesAndDistances_ReturnsExpectedPosition()
+        {
+            var triangulator = new Triangulator();
+            var baseLocations = new List<(double Latitude, double Longitude)>
+            {
+                (16.054407, 108.202167),
+                (16.049807, 108.218991),
+                (16.063597, 108.215553)
+            };
+
+            var distances = new List<double> { 0.5, 0.7, 0.6 };
+
+            var expectedPosition = (Latitude: 16.054, Longitude: 108.210);
+            var result = triangulator.CalculatePosition(baseLocations, distances);
+
+            Assert.That(result.Latitude, Is.EqualTo(expectedPosition.Latitude).Within(0.01));
+            Assert.That(result.Longitude, Is.EqualTo(expectedPosition.Longitude).Within(0.01));
+        }
+
+        [Test]
+        public void CalculatePosition_InvalidBaseLocations_ThrowsArgumentException()
+        {
+            var triangulator = new Triangulator();
+            var baseLocations = new List<(double Latitude, double Longitude)>
+        {
+            (10.762622, 106.660172)
+        };
+            var distances = new List<double> { 1.0 };
+
+            Assert.That(() => triangulator.CalculatePosition(baseLocations, distances), Throws.ArgumentException);
+        }
+
+        [Test]
+        public void CalculatePosition_InvalidDistances_ThrowsArgumentException()
+        {
+            var triangulator = new Triangulator();
+            var baseLocations = new List<(double Latitude, double Longitude)>
+        {
+            (10.762622, 106.660172),
+            (10.774981, 106.665504),
+            (10.771817, 106.681179)
+        };
+            var distances = new List<double> { 1.0 };
+
+            Assert.That(() => triangulator.CalculatePosition(baseLocations, distances), Throws.ArgumentException);
+        }
+    }
+}

Algorithms/Other/Triangulator.cs

@@ -0,0 +1,55 @@
+using System;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+using System.Threading.Tasks;
+
+namespace Algorithms.Other
+{
+    public class Triangulator
+    {
+        public (double Latitude, double Longitude) CalculatePosition(List<(double Latitude, double Longitude)> baseLocations, List<double> distances)
+        {
+            if (baseLocations.Count < 3 || distances.Count < 3)
+            {
+                throw new ArgumentException("At least three points and corresponding distances are required.");
+            }
+
+            // Get the coordinates of the three base stations
+            double lat1 = baseLocations[0].Latitude;
+            double lon1 = baseLocations[0].Longitude;
+            double lat2 = baseLocations[1].Latitude;
+            double lon2 = baseLocations[1].Longitude;
+            double lat3 = baseLocations[2].Latitude;
+            double lon3 = baseLocations[2].Longitude;
+
+            // Convert coordinates to radians
+            lat1 = ToRadians(lat1);
+            lon1 = ToRadians(lon1);
+            lat2 = ToRadians(lat2);
+            lon2 = ToRadians(lon2);
+            lat3 = ToRadians(lat3);
+            lon3 = ToRadians(lon3);
+
+            // Calculate the center point
+            double centerLat = (lat1 + lat2 + lat3) / 3;
+            double centerLon = (lon1 + lon2 + lon3) / 3;
+
+            // Convert back to degrees
+            centerLat = ToDegrees(centerLat);
+            centerLon = ToDegrees(centerLon);
+
+            return (centerLat, centerLon);
+        }
+
+        private double ToRadians(double degrees)
+        {
+            return degrees * Math.PI / 180;
+        }
+
+        private double ToDegrees(double radians)
+        {
+            return radians * 180 / Math.PI;
+        }
+    }
+}

README.md

@@ -223,6 +223,7 @@ find more than one implementation for the same objective but using different alg
     * [Julian Easter](./Algorithms/Other/JulianEaster.cs)
     * [Pollard's Rho](./Algorithms/Other/PollardsRhoFactorizing.cs)
     * [GeoLocation Hash](./Algorithms/Other/Geohash.cs)
+    * [Triangulation Algorithm](./Algorithms/Other/Triangulator.cs)
   * [Problems](./Algorithms/Problems)
     * [Stable Marriage](./Algorithms/Problems/StableMarriage)
       * [Gale-Shapley](./Algorithms/Problems/StableMarriage/GaleShapley.cs)