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.
Smallest-circle problemMinimum bounding boxConvex hull of a simple polygonMinimum bounding rectanglePoint in polygonClosest pair of points problemConvex hullEuclidean shortest pathCircle packing in a circleSnake-in-the-boxRectangle packingCoresetCircle packing in a squarePolygon triangulationBounding volumeGift wrapping algorithmGeometric medianIsoperimetric inequalityMinimal model programClique problemShortest path problemIntersection numberGauss circle problemDisk covering problemDimensionConvex bodyPick's theoremMinimum k-cutProjections onto convex setsTangential polygonFinite topological spaceMinimum cutCombinatorial optimizationEllipsoid methodCompact-open topologyRange minimum queryDistance from a point to a lineGraph isomorphism problemConstructible polygonMinimal surfaceLongest path problemOutline of geometryConvex optimizationGeneralized assignment problemTransitive closureP/polySimplicial complexCircumscribed circleConvex geometryMetric k-centerClosest stringLattice problemComputational geometryGraph bandwidthDirichlet problemNearest neighbor searchMaximum subarray problemSphere packing in a sphereOrthogonalizationSyntactic monoidConic optimizationBounding sphereSearch problemCyclic quadrilateralConvex polygonRelatively compact subspaceQuadratic programmingNo-three-in-line problemSquaring the squareSpreadHyperplane separation theoremOptimization problemBin packing problemPlanarity testingClosed setTangential quadrilateralSimplicial setField of fractionsEuclidean minimum spanning treeField of definitionHypercube graphInteger programmingAlpha shapeBasic feasible solutionHyperrectangleTriangulationComparison of topologiesSemicircleLow-dimensional topologyGeometric measure theoryClosed-subgroup theoremPolygonSquare tilingBounded inverse theoremLocal optimumLattice reductionGolden-section searchConstrained least squaresRange searchingComplexity class