public static IEnumerable <KeyValuePair <CurveSegment, CurveSegment> > SearchNearSegments(IEnumerable <ObjectId> selectedObjectIds, double tolerance)
{
var segments = GetAllCurveSegments(selectedObjectIds, tolerance, onlyForClosedPolygon: true);
var vertices = new List <CollisionVertex>();
foreach (var segment in segments)
{
var collisionVertices = segment.MiniBoundingBox.Select(it => new CollisionVertex()
{
Point = new Point3d(it.X, it.Y, 0.0),
Segment = segment
});
vertices.AddRange(collisionVertices);
}
// Create kd tree
var kdTree = new CurveVertexKdTree <CollisionVertex>(vertices, it => it.Point.ToArray(), ignoreZ: true);
// Use kd tree to check collision bounding box's intersection
var segmentPairs = new HashSet <KeyValuePair <CurveSegment, CurveSegment> >();
foreach (var segment in segments)
{
var extents = segment.GetExtents();
if (extents == null)
{
continue;
}
var minPoint = extents.Value.MinPoint;
var maxPoint = extents.Value.MaxPoint;
var nearVertices = kdTree.BoxedRange(new double[] { minPoint.X, minPoint.Y, 0.0 },
new double[] { maxPoint.X, maxPoint.Y, 0.0 });
foreach (var collisionVertex in nearVertices)
{
if (collisionVertex.Segment.EntityId == segment.EntityId ||
segmentPairs.Contains(new KeyValuePair <CurveSegment, CurveSegment>(segment, collisionVertex.Segment)) ||
segmentPairs.Contains(new KeyValuePair <CurveSegment, CurveSegment>(collisionVertex.Segment, segment)))
{
continue;
}
var boundingBox = segment.MiniBoundingBox.ToList();
boundingBox.Add(segment.MiniBoundingBox[0]);
if (!ComputerGraphics.IsInPolygon(boundingBox.ToArray(), new Point2d(collisionVertex.Point.X, collisionVertex.Point.Y), 4))
{
continue;
}
segmentPairs.Add(new KeyValuePair <CurveSegment, CurveSegment>(segment, collisionVertex.Segment));
}
}
return(segmentPairs);
}
private IEnumerable <IntersectionInfo> GetUnderShootIntersections2(IEnumerable <ObjectId> selectedObjectIds,
IEnumerable <CurveVertex> danglingVertices, double tolerance, Transaction transaction)
{
if (danglingVertices == null || !danglingVertices.Any())
{
return(new List <IntersectionInfo>());
}
var intersectMap = new Dictionary <CurveVertex, List <CurveVertex> >();
var desireExtendTypes = new Dictionary <CurveVertex, ExtendType>();
foreach (var vertex in danglingVertices)
{
var curve = transaction.GetObject(vertex.Id, OpenMode.ForRead);
var desiredExtend = CurveUtils.GetExtendType((Curve)curve, vertex.Point);
desireExtendTypes[vertex] = desiredExtend;
}
// 创建一个kdtree
var kdTree = new CurveVertexKdTree <CurveVertex>(danglingVertices, it => it.Point.ToArray(), ignoreZ: true);
foreach (var objectId in selectedObjectIds)
{
var curve = transaction.GetObject(objectId, OpenMode.ForRead) as Curve;
if (curve == null)
{
continue;
}
// 预检
var curveExtents = curve.GeometricExtents;
var vertices = kdTree.BoxedRange(curveExtents.MinPoint.ToArray(), curveExtents.MaxPoint.ToArray());
if (vertices == null || !vertices.Any())
{
continue;
}
var segments = CurveUtils.GetSegment2dsOfCurve(curve, transaction);
var segmentsForCollision = segments.Select(it => new CurveSegmentForCollision()
{
LineSegment = it,
EntityId = objectId,
MiniBoundingBox = CurveSegmentForCollision.CreateCollisionBoundingBox(it, tolerance)
});
foreach (var curveSegmentForCollision in segmentsForCollision)
{
var extents = curveSegmentForCollision.GetExtents();
if (extents == null)
{
continue;
}
var minPoint = extents.Value.MinPoint;
var maxPoint = extents.Value.MaxPoint;
var nearVertices = kdTree.BoxedRange(new double[] { minPoint.X, minPoint.Y, 0.0 },
new double[] { maxPoint.X, maxPoint.Y, 0.0 });
if (!nearVertices.Any())
{
continue;
}
var boundingBox = curveSegmentForCollision.MiniBoundingBox.ToList();
boundingBox.Add(curveSegmentForCollision.MiniBoundingBox[0]);
foreach (var curveVertex in nearVertices)
{
if (!ComputerGraphics.IsInPolygon(boundingBox.ToArray(), new Point2d(curveVertex.Point.X, curveVertex.Point.Y), 4))
{
continue;
}
var danglingCurve = (Curve)transaction.GetObject(curveVertex.Id, OpenMode.ForRead);
var danglingSegment = GetExtendLineSegment(danglingCurve, curveVertex.Point, transaction);
var danglineLine = new Line2d(danglingSegment.StartPoint, danglingSegment.EndPoint);
var intersectPoints = danglineLine.IntersectWith(curveSegmentForCollision.LineSegment);
if (intersectPoints == null || intersectPoints.Length <= 0)
{
continue;
}
var intersectPoint2D = intersectPoints[0];
var param = danglingSegment.GetParameterOf(intersectPoint2D);
var extendType = CurveIntersectUtils.ParamToExtendTypeForLine(param);
if (extendType != desireExtendTypes[curveVertex])
{
continue;
}
var intersectPoint = new Point3d(intersectPoint2D.X, intersectPoint2D.Y, 0);
var dist = (intersectPoint - curveVertex.Point).Length;
if (dist.Larger(tolerance))
{
continue;
}
List <CurveVertex> intersectList;
intersectMap.TryGetValue(curveVertex, out intersectList);
if (intersectList == null)
{
intersectList = new List <CurveVertex>();
intersectMap[curveVertex] = intersectList;
}
intersectList.Add(new CurveVertex(intersectPoint, curveSegmentForCollision.EntityId));
}
}
}
// 分析交点
var result = new List <IntersectionInfo>();
foreach (var pair in intersectMap)
{
var vertex = pair.Key;
var extendVertices = pair.Value;
var nearest = extendVertices[0];
var nearsetDist = (nearest.Point - vertex.Point).Length;
for (int i = 1; i < extendVertices.Count; i++)
{
var dist = (extendVertices[i].Point - vertex.Point).Length;
if (dist < nearsetDist)
{
nearsetDist = dist;
nearest = extendVertices[i];
}
}
result.Add(new IntersectionInfo(vertex.Id, desireExtendTypes[vertex], nearest.Id, ExtendType.None, nearest.Point));
}
return(result);
}
