Probing convex polygons with half-planes

DOI10.1016/0196-6774(91)90009-NzbMath0726.68083OpenAlexW1988874074MaRDI QIDQ3348454

Steven S. Skiena

Publication date: 1991

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(91)90009-n

zbMATH Keywords

convex polygonshalf-plane probe

Mathematics Subject Classification ID

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

Related Items (11)

Testing geometric objects ⋮ Testing orthogonal shapes ⋮ Probing convex polygons with a wedge ⋮ Reconstruction of polygons from projections ⋮ Techniques for exploring the suboptimal set ⋮ Shape from Silhouettes in Discrete Space ⋮ Local tests for consistency of support hyperplane data. ⋮ Model-based probing strategies for convex polygons ⋮ Probing polygons minimally is hard ⋮ Counting \(k\)-projections of a point set ⋮ ON RECTANGULAR COVERING PROBLEMS

This page was built for publication: Probing convex polygons with half-planes