| mAddAtts | Data.Geometry.Ipe.Writer, Data.Geometry.Ipe |
| makeBoundingBox | Data.Geometry.Arrangement.Internal |
| makeMonotone | Algorithms.Geometry.PolygonTriangulation.MakeMonotone |
| makePairs | Data.Geometry.Arrangement.Internal |
| makeTree | Algorithms.Graph.MST |
| Many | Data.Geometry.Vector.VectorFamilyPeano |
| map4 | Data.Geometry.Arrangement.Internal |
| mapMonotonic | |
| 1 (Function) | Data.OrdSeq |
| 2 (Function) | Data.SlowSeq |
| Mapping | Algorithms.Geometry.DelaunayTriangulation.Types |
| mapWithIndex | Data.LSeq |
| Matrix | |
| 1 (Data Constructor) | Data.Geometry.Ipe.Attributes, Data.Geometry.Ipe |
| 2 (Type/Class) | Data.Geometry.Transformation, Data.Geometry |
| 3 (Data Constructor) | Data.Geometry.Transformation, Data.Geometry |
| MatrixSym0 | Data.Geometry.Ipe.Attributes, Data.Geometry.Ipe |
| maxDist | Algorithms.Geometry.PolyLineSimplification.DouglasPeucker |
| maxInDirection | Data.Geometry.Polygon.Convex |
| MaxInfinity | Data.UnBounded |
| maxP | Data.Geometry.Box.Internal, Data.Geometry.Box |
| maxPoint | Data.Geometry.Box.Internal, Data.Geometry.Box |
| maxView | |
| 1 (Function) | Data.BalBST |
| 2 (Function) | Data.OrdSeq |
| 3 (Function) | Data.SlowSeq |
| maxWidth | Algorithms.Geometry.WellSeparatedPairDecomposition.WSPD |
| measure | Data.BinaryTree |
| Measured | Data.BinaryTree |
| member | Data.BalBST |
| memberBy | |
| 1 (Function) | Data.OrdSeq |
| 2 (Function) | Data.SlowSeq |
| Merge | |
| 1 (Data Constructor) | Algorithms.Geometry.PolygonTriangulation.MakeMonotone |
| 2 (Type/Class) | Algorithms.Geometry.DelaunayTriangulation.DivideAndConquer |
| merge | |
| 1 (Function) | Algorithms.Geometry.PolyLineSimplification.DouglasPeucker |
| 2 (Function) | Algorithms.Geometry.LineSegmentIntersection.BentleyOttmann |
| 3 (Function) | Data.Geometry.Polygon.Convex |
| 4 (Function) | Algorithms.Geometry.DelaunayTriangulation.DivideAndConquer |
| mergeBy | Algorithms.Geometry.PolygonTriangulation.TriangulateMonotone |
| mergePairs | Algorithms.Geometry.ClosestPair.DivideAndConquer |
| mergeSortedBy | Algorithms.Geometry.ClosestPair.DivideAndConquer |
| midPoint | Data.Range, Data.Geometry.Interval |
| minBy | Algorithms.Geometry.ClosestPair.DivideAndConquer |
| MinInfinity | Data.UnBounded |
| MiniPage | |
| 1 (Type/Class) | Data.Geometry.Ipe.Types, Data.Geometry.Ipe |
| 2 (Data Constructor) | Data.Geometry.Ipe.Types, Data.Geometry.Ipe |
| MiniPageAttributes | Data.Geometry.Ipe.Attributes, Data.Geometry.Ipe |
| minkowskiSum | Data.Geometry.Polygon.Convex |
| minP | Data.Geometry.Box.Internal, Data.Geometry.Box |
| minPoint | Data.Geometry.Box.Internal, Data.Geometry.Box |
| minView | |
| 1 (Function) | Data.BalBST |
| 2 (Function) | Data.OrdSeq |
| 3 (Function) | Data.SlowSeq |
| MIO | Data.Geometry.PlanarSubdivision.Draw |
| mkIpeObject | Data.Geometry.Ipe.Types, Data.Geometry.Ipe |
| mkMatrix | Data.Geometry.Ipe.PathParser |
| mkNode | Data.BalBST |
| mkPair | Algorithms.Geometry.ClosestPair.Naive |
| mkRow | Data.Geometry.Transformation, Data.Geometry |
| MKVector | Data.Geometry.Vector.VectorFamily, Data.Geometry.Vector, Data.Geometry |
| MonotonePolygon | Algorithms.Geometry.PolygonTriangulation.TriangulateMonotone |
| MoveTo | Data.Geometry.Ipe.Types, Data.Geometry.Ipe |
| moveUp | Algorithms.Geometry.DelaunayTriangulation.DivideAndConquer |
| mst | Algorithms.Graph.MST |
| mstEdges | Algorithms.Graph.MST |
| MSTW | Algorithms.Geometry.EuclideanMST.EuclideanMST |
| mult | Data.Geometry.Transformation, Data.Geometry |
| Multi | Data.Geometry.Polygon, Data.Geometry |
| MultiPolygon | |
| 1 (Type/Class) | Data.Geometry.Polygon, Data.Geometry |
| 2 (Data Constructor) | Data.Geometry.Polygon, Data.Geometry |
| multM | Data.Geometry.Transformation, Data.Geometry |