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.
Computational geometryConvex hull of a simple polygonMinimum bounding box algorithmsConvex geometryQuickhullConvex hullProjections onto convex setsConvex optimizationEllipsoid methodConvex hull algorithmsGeneral positionIndex calculus algorithmMidpoint circle algorithmBiconjugate gradient methodConvex analysisRotating calipersConvex polygonExponential sheaf sequenceEuler's theoremCompact-open topologyComputational topologyAlgebraic graph theoryAlpha shapeGeometric topologyConvex conjugateBounding volumeGabriel graphConjugate gradient methodSegre embeddingKarger's algorithmSliding dftConformal geometryClosed-subgroup theoremSweep line algorithmMapping class groupPolygon triangulationConvex bodyOrthogonalizationIsoperimetric inequalitySimplicial homologyQuadratic programmingHyperplane separation theoremErlangen programConstructible polygonGeometric transformationGeometric measure theoryPick's theoremGraph fourier transformCriss-cross algorithmHomotopy groups of spheresGeometry of numbersNonzero-ruleArithmetic geometryContour integrationGeneral topologyHypercube graphGeometric hashingSieve of pritchardHyperelliptic curveGoertzel algorithmT-splinePoint in polygonAlgebraic topologyHomological algebraGeometric algebraConic optimizationGraph homologyEuclidean topologyJohnson's algorithmNewton polytopeCongruenceStrassen algorithmTangential polygonDiophantine geometryHyperloglogSimplicial complexInverse iterationActive-set methodPiecewise linear manifoldCotangent complexPointwise convergenceBinary space partitioningAdjacency listSpecial number field sieveFloer homologyAdjacency matrixGeneralized conicMm algorithmGraph theoryCurvilinear coordinatesCompact convergenceCoarea formulaOutline of geometryImplicit surfaceTangent vectorGeometric function theoryGraph isomorphism problemGraph rewritingIntersection theoryLength function