使用Math.Atan2后出现错误，感觉是内存错误

 using System; using System.Collections.Generic; using System.Windows.Forms; using System.Text; using System.IO; namespace DoSearchPolygon { struct PointD { public double x; public double y; public PointD(double xx, double yy) { x = xx; y = yy; } public static bool operator ==(PointD p1, PointD p2) { return p1.x == p2.x && p1.y == p2.y; } public static bool operator !=(PointD p1, PointD p2) { return !(p1 == p2); } public override bool Equals(object obj) { PointD p = (PointD)obj; return p.x == x && p.y == y; } public override int GetHashCode() { return x.GetHashCode() ^ y.GetHashCode(); } public override string ToString() { return "x:" + x + ",y:" + y; } } struct SegmentD { public PointD startPoint; public PointD endPoint; public SegmentD(PointD p1, PointD p2) { startPoint = p1; endPoint = p2; Azimuth = 0; } public bool CheckIntersect(SegmentD checkSegment, out PointD intersectPointD) { intersectPointD = startPoint; double x11, x12, x21, x22, minX1, maxX1, minX2, maxX2; x11 = startPoint.x; x12 = endPoint.x; x21 = checkSegment.startPoint.x; x22 = checkSegment.endPoint.x; //GetMinMax(x11, x12, out minX1, out maxX1); //GetMinMax(x21, x22, out minX2, out maxX2); if (x11 < x12) { minX1 = x11; maxX1 = x12; } else { minX1 = x12; maxX1 = x11; } if (x21 < x22) { minX2 = x21; maxX2 = x22; } else { minX2 = x22; maxX2 = x21; } if (minX1 > maxX2 || maxX1 < minX2) { return false; } double y11, y12, y21, y22, minY1, maxY1, minY2, maxY2; y11 = startPoint.y; y12 = endPoint.y; y21 = checkSegment.startPoint.y; y22 = checkSegment.endPoint.y; //GetMinMax(y11, y12, out minY1, out maxY1); //GetMinMax(y21, y22, out minY2, out maxY2); if (y11 < y12) { minY1 = y11; maxY1 = y12; } else { minY1 = y12; maxY1 = y11; } if (y21 < y22) { minY2 = y21; maxY2 = y22; } else { minY2 = y22; maxY2 = y21; } if (minY1 > maxY2 || maxY1 < minY2) { return false; } double yDiff1 = y12 - y11; double yDiff2 = y22 - y21; if (yDiff1 == 0 && yDiff2 == 0) { return false; } double xDiff1 = x12 - x11; double xDiff2 = x22 - x21; if (xDiff1 == 0 && xDiff2 == 0) { return false; } if (xDiff1 == 0) { if (xDiff2 == 0) { return false; } double k2 = yDiff2 / xDiff2; // y - y21 = k2(x - x21) |x = x11; double y = k2 * (x11 - x21) + y21; if (y < minY1 || y > maxY1) { return false; } intersectPointD = new PointD(x11, y); } else if (xDiff2 == 0) { double k1 = yDiff1 / xDiff1; // y - y11 = k1(x - x11) |x = x21; double y = k1 * (x21 - x11) + y11; if (y < minY2 || y > maxY2) { return false; } intersectPointD = new PointD(x21, y); } else { double k1 = yDiff1 / xDiff1; double k2 = yDiff2 / xDiff2; if (k1 == k2) { return false; } /* * y - y11 = k1(x - x11), y - y21 = k2(x - x21) * => y21 - y11 = (k1 - k2) x + k2x21 - k1x11 * => x = (y21 - y11 + k1x11 - k2x21) / (k1 - k2) */ double x = (y21 - y11 + k1 * x11 - k2 * x21) / (k1 - k2); if (x < minX1 || x > maxX1 || x < minX2 || x > maxX2) { return false; } double y = k1 * (x - x11) + y11; intersectPointD = new PointD(x, y); } return true; } public void GetMinMax(double d1, double d2, out double min, out double max) { if (d1 < d2) { min = d1; max = d2; } else { min = d2; max = d1; } } public override bool Equals(object obj) { SegmentD s = (SegmentD)obj; return startPoint == s.startPoint && endPoint == s.endPoint; } public override int GetHashCode() { return startPoint.GetHashCode() ^ endPoint.GetHashCode(); } public override string ToString() { return "(" + startPoint.ToString() + ")->(" + endPoint.ToString() + ")"; } public double Azimuth; public void CalAzimuth() { Azimuth = GetMyAzimuth(endPoint.y - startPoint.y, endPoint.x - startPoint.x); } internal static double GetMyAzimuth(double y, double x) { bool useAtan2 = true; // 用Atan2不可以，用自己的方法就没问题了 if (useAtan2) { return Math.Atan2(y, x); } else { if (x == 0) { if (y == 0) { return 0; } else if (y > 0) { return 1; } else { return 3; } } else if (y == 0) { if (x > 0) { return 0; } else { return 2; } } else { if (x > 0) { if (y > 0) { return y / (x + y); } else { return 4 + y / (x - y); // 4 - (-y) / (x-y) } } else { if (y > 0) { return 2 - y / (y - x); } else { return 2 + y / (x + y); // 2 + (-y) / (-x-y) } } } } } } class PolygonD { public List<SegmentD> segments = new List<SegmentD>(); public override string ToString() { StringBuilder builder = new StringBuilder(); builder.AppendLine("点数目:" + segments.Count); foreach (SegmentD segment in segments) { builder.AppendLine(segment.ToString()); } builder.AppendLine(); return builder.ToString(); } } class PolygonSearch { Dictionary<PointD, List<SegmentD>> allPoints = new Dictionary<PointD, List<SegmentD>>(); internal SegmentD[] allSegments = null; List<PolygonD> polygons = new List<PolygonD>(); internal int maxIndex = -1; Dictionary<SegmentD, bool> segmentSign = new Dictionary<SegmentD, bool>(); public List<PolygonD> GetPolygons(List<SegmentD> lineList) { if (lineList.Count == 0) { return new List<PolygonD>(); } allSegments = new SegmentD[lineList.Count * 10]; lineList.CopyTo(allSegments, 0); maxIndex = lineList.Count - 1; FindAllSegments(); BuildAllPoints(); ClearUsefulessPoints(); BuildSegmentSign(); FindPolygon(); return polygons; } void FindAllSegments() { PointD intersectPointD; for (int allIndex = 0; allIndex < maxIndex; allIndex++) { SegmentD checkSegmentD = allSegments[allIndex]; for (int tempIndex = allIndex + 1; tempIndex <= maxIndex; tempIndex++) { SegmentD tempSegment = allSegments[tempIndex]; if (checkSegmentD.CheckIntersect(tempSegment, out intersectPointD)) { if (checkSegmentD.startPoint != intersectPointD && checkSegmentD.endPoint != intersectPointD) { maxIndex++; allSegments[maxIndex] = new SegmentD(checkSegmentD.endPoint, intersectPointD); checkSegmentD = new SegmentD(checkSegmentD.startPoint, intersectPointD); allSegments[allIndex] = checkSegmentD; } if (tempSegment.startPoint != intersectPointD && tempSegment.endPoint != intersectPointD) { maxIndex++; allSegments[tempIndex] = new SegmentD(tempSegment.startPoint, intersectPointD); allSegments[maxIndex] = new SegmentD(tempSegment.endPoint, intersectPointD); } } } } } void BuildAllPoints() { for (int i = 0; i <= maxIndex; i++) { SegmentD segment = allSegments[i]; PointD p1 = segment.startPoint; PointD p2 = segment.endPoint; if (!allPoints.ContainsKey(p1)) { allPoints.Add(p1, new List<SegmentD>()); } segment.CalAzimuth(); allPoints[p1].Add(segment); if (!allPoints.ContainsKey(p2)) { allPoints.Add(p2, new List<SegmentD>()); } segment = new SegmentD(p2, p1); segment.CalAzimuth(); allPoints[p2].Add(segment); } } void ClearUsefulessPoints() { PointD[] keys = new PointD[allPoints.Count]; allPoints.Keys.CopyTo(keys, 0); foreach (PointD p in keys) { if (!allPoints.ContainsKey(p)) { continue; } List<SegmentD> segments = allPoints[p]; if (segments.Count == 0) { allPoints.Remove(p); } else if (segments.Count == 1) { DeleteSegment(p, segments[0]); } } } void DeleteSegment(PointD pointD, SegmentD segment) { if (!allPoints.ContainsKey(pointD)) { return; } List<SegmentD> segmentList = allPoints[pointD]; if (segmentList.Count == 0) { allPoints.Remove(pointD); return; } else if (segmentList.Count == 1) { allPoints.Remove(pointD); DeleteSegment(segment.endPoint, new SegmentD(segment.endPoint, segment.startPoint)); } else { segmentList.Remove(segment); DeleteSegment(segment.endPoint, new SegmentD(segment.endPoint, segment.startPoint)); if (segmentList.Count == 1) { SegmentD lastSegment = segmentList[0]; allPoints.Remove(lastSegment.startPoint); DeleteSegment(lastSegment.endPoint, new SegmentD(lastSegment.endPoint, lastSegment.startPoint)); } } } void BuildSegmentSign() { foreach (KeyValuePair<PointD, List<SegmentD>> pair in allPoints) { foreach (SegmentD segment in pair.Value) { segment.CalAzimuth(); if (!segmentSign.ContainsKey(segment)) { segmentSign.Add(segment, false); } SegmentD rSegment = new SegmentD(segment.endPoint, segment.startPoint); if (!segmentSign.ContainsKey(rSegment)) { segmentSign.Add(rSegment, false); } } pair.Value.Sort(SortSegmentD); } } void FindPolygon() { SegmentD nextSegment; foreach (KeyValuePair<PointD, List<SegmentD>> pair in allPoints) { foreach (SegmentD segment in pair.Value) { if (segmentSign[segment]) { continue; } PolygonD p = new PolygonD(); PointD firstPointD = segment.startPoint; p.segments.Add(segment); segmentSign[segment] = true; SegmentD currentSegment = segment; while (FindNextSegment(currentSegment, out nextSegment)) { currentSegment = nextSegment; p.segments.Add(nextSegment); segmentSign[nextSegment] = true; if (nextSegment.endPoint == firstPointD) { polygons.Add(p); break; } } } } } bool FindNextSegment(SegmentD currentSegment, out SegmentD nextSegment) { nextSegment = currentSegment; PointD p = currentSegment.endPoint; if (!allPoints.ContainsKey(p)) { return false; } List<SegmentD> segmentList = allPoints[p]; double azimuth = SegmentD.GetMyAzimuth(currentSegment.startPoint.y - currentSegment.endPoint.y, currentSegment.startPoint.x - currentSegment.endPoint.x); //File.AppendAllText("Azimuth.txt", azimuth.ToString() + Environment.NewLine);// 这行一加就不出错了 int findIndex = -1; for (int i = 0; i < segmentList.Count; i++) { if (segmentList[i].Azimuth < azimuth) { findIndex = i; } else { break; } } if (findIndex == -1) { nextSegment = segmentList[segmentList.Count - 1]; } else { nextSegment = segmentList[findIndex]; } if (segmentSign[nextSegment]) { return false; } return true; } int SortSegmentD(SegmentD s1, SegmentD s2) { return s1.Azimuth.CompareTo(s2.Azimuth); } } static class Program { static void Main() { PolygonSearch search = new PolygonSearch(); List<SegmentD> segments = new List<SegmentD>(); segments.Clear(); segments.Add(new SegmentD(new PointD(0, 0), new PointD(4, 0))); segments.Add(new SegmentD(new PointD(0, 0), new PointD(5, 2))); segments.Add(new SegmentD(new PointD(0, 3), new PointD(4, 3))); segments.Add(new SegmentD(new PointD(1, 0), new PointD(1, 4))); segments.Add(new SegmentD(new PointD(3, 0), new PointD(3, 4))); segments.Add(new SegmentD(new PointD(3, 4), new PointD(4, 4))); segments.Add(new SegmentD(new PointD(5, 4), new PointD(0, 1))); List<PolygonD> polygons = null; for (int i = 0; i < 10; i++) { polygons = search.GetPolygons(segments); } MessageBox.Show("共找到" + polygons.Count.ToString() + "个多边形"); using (StreamWriter sw = new StreamWriter("Polygons.txt", false, Encoding.Default)) { foreach (PolygonD p in polygons) { sw.WriteLine(p.ToString()); } } } } }

      发现过程：如上代码在Debug和Release下执行程序时，出来的结果不一样（Bebug下找到6个，Release下找到4个），由于代码中并没有使用不安全代码，所以怀疑是Math.Atan2的问题，于是在代码483行加入代码 File.AppendAllText("Azimuth.txt", azimuth.ToString() + Environment.NewLine);想打印出Release时计算出来的角度，但是一加这行代码后，结果却莫名其妙的正确了。后来由于考虑到实现中实际只需要按方向做角度排序，并不需要算出较精确的角度，所以在代码208行用了一个其他的方法绕过了Math.Atan2的使用，至此代码不管在Debug下还是在Release下都能正常出结果了。

        因为以前只有在c++中出现过这种问题，是因为指针使用不当，出现的内存问题，所以这边只能怀疑是Math.Atan2的方法有较隐蔽的内存错误，而Math.Atan2这个方法微软也确实是调用了它的底层库，不知其具体实现。也请各位大侠指点

 

ps:

1.这条大虾请无视，Debug下F5还是Ctrl+F5没关系，但Release必须Ctrl+F5或者运行编译后的exe才算执行程序，才能看到差异

2.我同事的机器和我自己家里的机器都会出这问题，但我自己公司的机器确没有这问题，所以我这不能保证这个问题一定能在你的机器上出现