pith. machine review for the scientific record. sign in

Title resolution pending

URL: https://www · 1992 · DOI 10.1007/bf02293051

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

1 Pith paper citing it
open at publisher 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

Visibility Queries in Simple Polygons

cs.CG · 2026-05-05 · unverdicted · novelty 6.0

Improved space-time tradeoffs for visibility polygon queries: O(n^{2+ε}) space for O(log n + k) time, plus better bounds in other regimes using a new polygon decomposition.

citing papers explorer

Showing 1 of 1 citing paper.

  • Visibility Queries in Simple Polygons cs.CG · 2026-05-05 · unverdicted · none · ref 12

    Improved space-time tradeoffs for visibility polygon queries: O(n^{2+ε}) space for O(log n + k) time, plus better bounds in other regimes using a new polygon decomposition.