Pith. sign in

Title resolution pending

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

1 Pith paper citing it

fields

cs.CG 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

Contiguous Boundary Guarding

cs.CG · 2024-12-19 · conditional · novelty 8.0

Contiguous boundary guarding of a simple polygon can be solved optimally in polynomial time, and the tight worst-case guard number is about n/2 for an n-corner polygon.

citing papers explorer

Showing 1 of 1 citing paper.

  • Contiguous Boundary Guarding cs.CG · 2024-12-19 · conditional · none · ref 4

    Contiguous boundary guarding of a simple polygon can be solved optimally in polynomial time, and the tight worst-case guard number is about n/2 for an n-corner polygon.