From 85c1ea10f40d956c7db9aa6d0d681ef9ce97f308 Mon Sep 17 00:00:00 2001
From: Mayank Mohapatra <125661248+Mayank77maruti@users.noreply.github.com>
Date: Sat, 22 Feb 2025 10:50:31 +0000
Subject: [PATCH] try

---
 d2layouts/d2cycle/layout.go | 82 ++++++++++++++-----------------------
 1 file changed, 31 insertions(+), 51 deletions(-)

diff --git a/d2layouts/d2cycle/layout.go b/d2layouts/d2cycle/layout.go
index af13cc00e..0e9036f74 100644
--- a/d2layouts/d2cycle/layout.go
+++ b/d2layouts/d2cycle/layout.go
@@ -66,64 +66,44 @@ func positionObjects(objects []*d2graph.Object, radius float64) {
 }
 
 func createCircularArc(edge *d2graph.Edge) {
-    if edge.Src == nil || edge.Dst == nil {
-        return
-    }
+	if edge.Src == nil || edge.Dst == nil {
+		return
+	}
 
-    srcCenter := edge.Src.Center()
-    dstCenter := edge.Dst.Center()
+	srcCenter := edge.Src.Center()
+	dstCenter := edge.Dst.Center()
 
-    // Calculate the radius based on the distance from origin to the centers
-    srcRadius := math.Hypot(srcCenter.X, srcCenter.Y)
-    dstRadius := math.Hypot(dstCenter.X, dstCenter.Y)
-    
-    // Use average radius for more consistent arcs
-    
+	srcAngle := math.Atan2(srcCenter.Y, srcCenter.X)
+	dstAngle := math.Atan2(dstCenter.Y, dstCenter.X)
+	if dstAngle < srcAngle {
+		dstAngle += 2 * math.Pi
+	}
 
-    // Calculate angles but preserve relative positioning
-    srcAngle := math.Atan2(srcCenter.Y, srcCenter.X)
-    dstAngle := math.Atan2(dstCenter.Y, dstCenter.X)
+	arcRadius := math.Hypot(srcCenter.X, srcCenter.Y)
 
-    // Ensure we take the shorter path around the circle
-    if dstAngle < srcAngle {
-        if srcAngle - dstAngle > math.Pi {
-            dstAngle += 2 * math.Pi
-        }
-    } else {
-        if dstAngle - srcAngle > math.Pi {
-            srcAngle += 2 * math.Pi
-        }
-    }
+	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))
+	}
+	path[0] = srcCenter
+	path[len(path)-1] = dstCenter
 
-    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)
-        
-        // Use interpolated radius for smoother transition
-        radius := srcRadius + t*(dstRadius-srcRadius)
-        
-        x := radius * math.Cos(angle)
-        y := radius * math.Sin(angle)
-        path = append(path, geo.NewPoint(x, y))
-    }
-    
-    // Ensure exact endpoints
-    path[0] = srcCenter
-    path[len(path)-1] = dstCenter
+	// Clamp endpoints to the boundaries of the source and destination boxes.
+	_, newSrc := clampPointOutsideBox(edge.Src.Box, path, 0)
+	_, newDst := clampPointOutsideBoxReverse(edge.Dst.Box, path, len(path)-1)
+	path[0] = newSrc
+	path[len(path)-1] = newDst
 
-    // Clamp endpoints to the boundaries of the source and destination boxes
-    _, newSrc := clampPointOutsideBox(edge.Src.Box, path, 0)
-    _, newDst := clampPointOutsideBoxReverse(edge.Dst.Box, path, len(path)-1)
-    path[0] = newSrc
-    path[len(path)-1] = newDst
+	// Trim redundant path points that fall inside node boundaries.
+	path = trimPathPoints(path, edge.Src.Box)
+	path = trimPathPoints(path, edge.Dst.Box)
 
-    // Trim redundant path points that fall inside node boundaries
-    path = trimPathPoints(path, edge.Src.Box)
-    path = trimPathPoints(path, edge.Dst.Box)
-
-    edge.Route = path
-    edge.IsCurve = true
+	edge.Route = path
+	edge.IsCurve = true
 }
 
 // clampPointOutsideBox walks forward along the path until it finds a point outside the box,