pith. sign in

Journal of Symbolic Computation5(1–2), 37–64 (1988)

· 1988 · DOI 10.1016/s0747-7171(88)80005-1

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

fields

cs.CG 2

years

2026 1 2019 1

verdicts

UNVERDICTED 2

representative citing papers

Smoothed Analysis of Order Types

cs.CG · 2019-07-10 · unverdicted · novelty 7.0

Order type realizability, ∃R-complete in the worst case, can be decided in expected NP time under smoothed analysis.

Realizing Planar Linkages in Polygonal Domains

cs.CG · 2026-04-07 · unverdicted · novelty 6.0

Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.

citing papers explorer

Showing 2 of 2 citing papers.

  • Smoothed Analysis of Order Types cs.CG · 2019-07-10 · unverdicted · none · ref 21

    Order type realizability, ∃R-complete in the worst case, can be decided in expected NP time under smoothed analysis.

  • Realizing Planar Linkages in Polygonal Domains cs.CG · 2026-04-07 · unverdicted · none · ref 17

    Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.