Skip to content

Reuse sorted edge projections and completed rectangle expansion searches #164

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
imrishabh18 merged 8 commits into from
Oct 20, 2026
Merged

Reuse sorted edge projections and completed rectangle expansion searches #164

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
91701a2
perf: index quantized blockers during edge seeding
rishabh2002 Oct 19, 2026
e754676
Index exact edge-distance ranking and skip duplicate work
rishabh2002 Oct 19, 2026
f9ebf33
Add visual regression snapshot for indexed edge candidates
rishabh2002 Oct 19, 2026
4661e0a
Show reduced blocker-query work in a reviewable SVG snapshot
imrishabh18 Oct 19, 2026
9a2d185
Follow handbook two-parameter rule in edge query and test helpers
imrishabh18 Oct 19, 2026
c716840
Reuse sorted edge projections and completed expansion searches
imrishabh18 Oct 20, 2026
2e1edb4
Store shared edge tasks by traversal ordinal to reduce allocations
imrishabh18 Oct 20, 2026
d3a8b09
Preserve raw edge ranking for reversed rectangle extents
imrishabh18 Oct 20, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 7 additions & 5 deletions lib/solvers/RectDiffSeedingSolver/RectDiffSeedingSolver.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,6 @@ import { computeDefaultGridSizes } from "./computeDefaultGridSizes"
import { computeCandidates3D } from "./computeCandidates3D"
import { computeEdgeCandidates3D } from "./computeEdgeCandidates3D"
import { longestFreeSpanAroundZ } from "./longestFreeSpanAroundZ"
import { allLayerNode } from "../../utils/buildHardPlacedByLayer"
import { isFullyOccupiedAtPoint } from "../../utils/isFullyOccupiedAtPoint"
import { resizeSoftOverlaps } from "../../utils/resizeSoftOverlaps"
import { getColorForZLayer } from "../../utils/getColorForZLayer"
Expand Down Expand Up @@ -292,10 +291,13 @@ export class RectDiffSeedingSolver extends BaseSolver {
},
newIndex,
)
this.hardPlacedByLayer = allLayerNode({
layerCount: this.layerCount,
placed: this.placed,
})
// Full-stack nodes are protected from soft-overlap carving, so their
// layer lists only grow during seeding.
if (placed.zLayers.length >= this.layerCount) {
for (const z of placed.zLayers) {
this.hardPlacedByLayer[z]!.push(placed.rect)
}
}

return // processed one candidate
}
Expand Down
Loading
Loading