Probing polygons minimally is hard

DOI10.1016/0925-7721(93)90022-XzbMath0782.68112OpenAlexW1995282992MaRDI QIDQ1803270

Patrice Belleville, Thomas C. Shermer

Publication date: 29 June 1993

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(93)90022-x

zbMATH Keywords

NP-completenessprobing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Testing geometric objects ⋮ Data structures for maintaining set partitions ⋮ A note on data structures for maintaining bipartitions ⋮ Testing simple polygons. ⋮ Exact Learning of Discretized Geometric Concepts ⋮ Decision Trees for Geometric Models

Cites Work

• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Probing convex polygons with half-planes

This page was built for publication: Probing polygons minimally is hard