package d2cycle import ( "context" "math" "oss.terrastruct.com/d2/d2graph" "oss.terrastruct.com/d2/lib/geo" "oss.terrastruct.com/d2/lib/label" "oss.terrastruct.com/util-go/go2" ) const ( MIN_RADIUS = 200 PADDING = 20 MIN_SEGMENT_LEN = 10 ARC_STEPS = 30 EPSILON = 1e-10 // Small value for floating point comparisons ) func Layout(ctx context.Context, g *d2graph.Graph, layout d2graph.LayoutGraph) error { objects := g.Root.ChildrenArray if len(objects) == 0 { return nil } for _, obj := range g.Objects { positionLabelsIcons(obj) } radius := calculateRadius(objects) positionObjects(objects, radius) for _, edge := range g.Edges { createPreciseCircularArc(edge) } return nil } func calculateRadius(objects []*d2graph.Object) float64 { numObjects := float64(len(objects)) maxSize := 0.0 for _, obj := range objects { size := math.Max(obj.Box.Width, obj.Box.Height) maxSize = math.Max(maxSize, size) } minRadius := (maxSize/2.0 + PADDING) / math.Sin(math.Pi/numObjects) return math.Max(minRadius, MIN_RADIUS) } func positionObjects(objects []*d2graph.Object, radius float64) { numObjects := float64(len(objects)) angleOffset := -math.Pi / 2 for i, obj := range objects { angle := angleOffset + (2*math.Pi*float64(i)/numObjects) x := radius * math.Cos(angle) y := radius * math.Sin(angle) obj.TopLeft = geo.NewPoint( x-obj.Box.Width/2, y-obj.Box.Height/2, ) } } func createPreciseCircularArc(edge *d2graph.Edge) { if edge.Src == nil || edge.Dst == nil { return } srcCenter := edge.Src.Center() dstCenter := edge.Dst.Center() // Calculate angles in the circular layout srcAngle := math.Atan2(srcCenter.Y, srcCenter.X) dstAngle := math.Atan2(dstCenter.Y, dstCenter.X) if dstAngle < srcAngle { dstAngle += 2 * math.Pi } arcRadius := math.Hypot(srcCenter.X, srcCenter.Y) // Generate initial path points path := make([]*geo.Point, 0, ARC_STEPS+1) for i := 0; i <= ARC_STEPS; i++ { t := float64(i) / float64(ARC_STEPS) angle := srcAngle + t*(dstAngle-srcAngle) x := arcRadius * math.Cos(angle) y := arcRadius * math.Sin(angle) path = append(path, geo.NewPoint(x, y)) } // Find precise intersection points srcIntersection := findPreciseBoxIntersection(edge.Src.Box, path[0], path[1]) dstIntersection := findPreciseBoxIntersection(edge.Dst.Box, path[len(path)-1], path[len(path)-2]) // Update path endpoints with precise intersections path[0] = srcIntersection path[len(path)-1] = dstIntersection // Remove any points that might be inside the boxes startIdx := 0 endIdx := len(path) - 1 for i := 1; i < len(path)-1; i++ { if boxContains(edge.Src.Box, path[i]) { startIdx = i } if boxContains(edge.Dst.Box, path[i]) { endIdx = i break } } edge.Route = path[startIdx:endIdx+1] edge.IsCurve = true } func findPreciseBoxIntersection(box *geo.Box, p1, p2 *geo.Point) *geo.Point { // Define box edges as line segments edges := []geo.Segment{ // Top edge *geo.NewSegment( geo.NewPoint(box.TopLeft.X, box.TopLeft.Y), geo.NewPoint(box.TopLeft.X+box.Width, box.TopLeft.Y), ), // Right edge *geo.NewSegment( geo.NewPoint(box.TopLeft.X+box.Width, box.TopLeft.Y), geo.NewPoint(box.TopLeft.X+box.Width, box.TopLeft.Y+box.Height), ), // Bottom edge *geo.NewSegment( geo.NewPoint(box.TopLeft.X, box.TopLeft.Y+box.Height), geo.NewPoint(box.TopLeft.X+box.Width, box.TopLeft.Y+box.Height), ), // Left edge *geo.NewSegment( geo.NewPoint(box.TopLeft.X, box.TopLeft.Y), geo.NewPoint(box.TopLeft.X, box.TopLeft.Y+box.Height), ), } // Line segment from p1 to p2 line := *geo.NewSegment(p1, p2) // Find the intersection point closest to p1 var closestIntersection *geo.Point minDist := math.MaxFloat64 for _, edge := range edges { if intersection := findSegmentIntersection(line, edge); intersection != nil { dist := math.Hypot( intersection.X-p1.X, intersection.Y-p1.Y, ) if dist < minDist { minDist = dist closestIntersection = intersection } } } if closestIntersection != nil { return closestIntersection } return p1 } func findSegmentIntersection(s1, s2 geo.Segment) *geo.Point { // Calculate the intersection of two line segments using parametric equations x1, y1 := s1.Start.X, s1.Start.Y x2, y2 := s1.End.X, s1.End.Y x3, y3 := s2.Start.X, s2.Start.Y x4, y4 := s2.End.X, s2.End.Y denominator := (x1-x2)*(y3-y4) - (y1-y2)*(x3-x4) if math.Abs(denominator) < EPSILON { return nil } t := ((x1-x3)*(y3-y4) - (y1-y3)*(x3-x4)) / denominator u := -((x1-x2)*(y1-y3) - (y1-y2)*(x1-x3)) / denominator if t >= 0 && t <= 1 && u >= 0 && u <= 1 { x := x1 + t*(x2-x1) y := y1 + t*(y2-y1) return geo.NewPoint(x, y) } return nil } func boxContains(b *geo.Box, p *geo.Point) bool { return p.X >= b.TopLeft.X-EPSILON && p.X <= b.TopLeft.X+b.Width+EPSILON && p.Y >= b.TopLeft.Y-EPSILON && p.Y <= b.TopLeft.Y+b.Height+EPSILON } func positionLabelsIcons(obj *d2graph.Object) { if obj.Icon != nil && obj.IconPosition == nil { if len(obj.ChildrenArray) > 0 { obj.IconPosition = go2.Pointer(label.OutsideTopLeft.String()) if obj.LabelPosition == nil { obj.LabelPosition = go2.Pointer(label.OutsideTopRight.String()) return } } else if obj.SQLTable != nil || obj.Class != nil || obj.Language != "" { obj.IconPosition = go2.Pointer(label.OutsideTopLeft.String()) } else { obj.IconPosition = go2.Pointer(label.InsideMiddleCenter.String()) } } if obj.HasLabel() && obj.LabelPosition == nil { if len(obj.ChildrenArray) > 0 { obj.LabelPosition = go2.Pointer(label.OutsideTopCenter.String()) } else if obj.HasOutsideBottomLabel() { obj.LabelPosition = go2.Pointer(label.OutsideBottomCenter.String()) } else if obj.Icon != nil { obj.LabelPosition = go2.Pointer(label.InsideTopCenter.String()) } else { obj.LabelPosition = go2.Pointer(label.InsideMiddleCenter.String()) } if float64(obj.LabelDimensions.Width) > obj.Width || float64(obj.LabelDimensions.Height) > obj.Height { if len(obj.ChildrenArray) > 0 { obj.LabelPosition = go2.Pointer(label.OutsideTopCenter.String()) } else { obj.LabelPosition = go2.Pointer(label.OutsideBottomCenter.String()) } } } }