Model-based probing strategies for convex polygons

DOI10.1016/0925-7721(92)90023-LzbMath0769.52001OpenAlexW2088549534MaRDI QIDQ1208433

Eugene Joseph, Steven S. Skiena

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1016/0925-7721(92)90023-l

zbMATH Keywords

convex polygonlower boundsgeometric probingfinger probesline probes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (2)

Testing geometric objects ⋮ Decision Trees for Geometric Models

Cites Work

• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
• Reconstruction of polygons from projections
• The maximum number of unit distances in a convex \(n\)-gon
• Non-convex contour reconstruction
• Probing convex polygons with half-planes
• Shape from probing
• An Optimal-Time Algorithm for Slope Selection

This page was built for publication: Model-based probing strategies for convex polygons