Probing polygons minimally is hard
From MaRDI portal
Publication:1803270
DOI10.1016/0925-7721(93)90022-XzbMath0782.68112MaRDI QIDQ1803270
Thomas C. Shermer, Patrice Belleville
Publication date: 29 June 1993
Published in: Computational Geometry (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Decision Trees for Geometric Models, Data structures for maintaining set partitions, Testing geometric objects, Exact Learning of Discretized Geometric Concepts
Cites Work