Algorithm Search⌘K

Algorithmadvanced

Slab method

Also called Dobkin-Lipton slab method, slab decomposition.

Cut the plane into vertical slabs at each vertex x-coordinate and binary search the slab, then the segments within it.

Cut the plane into vertical slabs at each vertex x-coordinate and binary search the slab, then the segments within it.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • the section The problem
  • pseudocode in The algorithm
  • complexity claims in the front matter
  • one source with a locator

Tag T6VRZV Edit this page History Report an error