Pith. sign in

REVIEW 1 cited by

Linking disjoint segments into a simple polygon is hard

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2108.12812 v2 pith:DUGDKL55 submitted 2021-08-29 cs.CG cs.CC

Rain Jiang , Kai Jiang , Minghui Jiang This is my paper · ORCID
classification cs.CGcs.CC
keywords segmentssimpledisjointpolygonaddingchaindecidingendpoints
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On plane cycles in geometric multipartite graphs

    cs.CG 2025-06 reject novelty 7.0 of 10

    New bounds and an FPT algorithm for plane cycles in geometric bipartite graphs, but the main characterization theorem is refuted by a four-point counterexample.

Pith tools