MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Euclidean shortest pathSmallest-circle problemMinimum bounding box algorithmsNearest neighbor searchShortest path problemPoint in polygonLongest common subsequence problemPolygon triangulationDistance formulaDistance from a point to a planeClique problemOptimization problemMetricClosest stringProjections onto convex setsLongest path problemDelaunay triangulationDistance from a point to a lineConvex hull of a simple polygonDistanceGeometric medianCoresetGauss circle problemGabriel graphSubgraph isomorphism problemMaximum weight matchingGraph isomorphism problemIsometryMinimum bounding boxKolmogorov spaceRectangle packingLagrange polynomialProjective planeDisk covering problemTriangulationNo-three-in-line problemMetric k-centerLongest common substring problemEuclidean distanceCoordinate systemOpen ballHausdorff distanceSolution of trianglesDistance matrixCircle packing in a circleGraph bandwidthPlanarity testingMetric spaceMaximum subarray problemAffine varietyPolar coordinatesMatrix chain multiplicationLongest increasing subsequenceNearest neighbor graphDirichlet problemEuclidean minimum spanning treeCartesian coordinatesSpreadDiscrete metricTranslateEigenvalue perturbationLocal optimumCauchy problemPerpendicular distanceQuadralEuclidean distance matrixComplement graphLimit pointPartition problemRange searchingProduct measureRigid transformationNormal spaceAlhazen's problemMinimum k-cutPerturbation theoryDiophantine equationSeparated setsNon-euclidean geometryRadial curveChinese postman problemRamer-douglas-peucker algorithmGauss mapLeast squaresPair distribution functionSystem of equationsCentroidEppstein's algorithmLongest palindromic substringDiscrete setPointclassEuclidean geometryTaxicab distanceLattice reductionDense graphTravelling salesman problemRadical lineSimson lineGraph of a functionDivisibility sequence