pith. machine review for the scientific record. sign in

Title resolution pending

Association for Computing Machinery · 2024 · arXiv 7817.997839

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
read on arXiv browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CG 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Touring a Sequence of Orthogonal Polygons

cs.CG · 2026-05-08 · unverdicted · novelty 7.0 · 2 refs

Subquadratic Õ(n^{2-1/48}) algorithm for shortest tours of disjoint orthogonal polygons, plus linear-time results for ortho-convex and rectangular cases.

citing papers explorer

Showing 1 of 1 citing paper.

  • Touring a Sequence of Orthogonal Polygons cs.CG · 2026-05-08 · unverdicted · none · ref 15 · 2 links

    Subquadratic Õ(n^{2-1/48}) algorithm for shortest tours of disjoint orthogonal polygons, plus linear-time results for ortho-convex and rectangular cases.