feat: implement SameNetTraceMergeSolver to snap and fuse collinear traces (#34)#323
Open
IssacDanny wants to merge 3 commits into
Open
feat: implement SameNetTraceMergeSolver to snap and fuse collinear traces (#34)#323IssacDanny wants to merge 3 commits into
IssacDanny wants to merge 3 commits into
Conversation
|
The latest updates on your projects. Learn more about Vercel for GitHub.
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
/claim #34
Intuition:
Schematic traces belonging to the same net often run parallel and
close together. Snapping these to a common axis and fusing them into a single
path improves schematic readability and reduces the total number of trace
objects in the final layout.
Approach:
The SameNetTraceMergeSolver is implemented using a Hylomorphism pattern
to separate data deconstruction from merging logic:
into individual segments. Each segment is tagged with its NetId and
orientation (Horizontal/Vertical).
sorted by their fixed coordinate. A greedy clustering algorithm identifies
segments within a 0.1 unit tolerance that share an overlapping range. These
clusters are snapped to their calculated average coordinate.
segments that touch at their endpoints. This collapses fragmented segments
back into a minimal set of continuous SolvedTracePath objects.
process are removed using simplifyPath.
Complexity:
all traces. The complexity is dominated by the sorting step required for
greedy clustering.
heap to ensure O(1) stack depth.
Verification Results
single paths.
tests are passing (with 4 expected skips).