Model-based probing strategies for convex polygons

DOI10.1016/0925-7721(92)90023-LMaRDI QIDQ1208433zbMATH OpenOpenAlexFDO

Authors Eugene Joseph, Steven 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

lower boundsconvex polygongeometric probingfinger probesline probes

Mathematics Subject Classification ID

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

Recommendations

• Probing convex polygons with half-planes
• EFFICIENT APPROXIMATION OF CONVEX POLYGONS
• An improved on-line strategy for exploring unknown polygons
• Non-interactive geometric probing: Reconstruction non-convex polygons
• scientific article; zbMATH DE number 701117
• Probing convex polygons with a wedge
• Fast computation of the modality of polygons
• Probing a scene of nonconvex polyhedra

Cites work

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

Cited in

(8)

• Shape from probing
• Decision Trees for Geometric Models
• Testing geometric objects
• Point probe decision trees for geometric concept classes
• Reconstruction of polygons from projections
• Probing a scene of nonconvex polyhedra
• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
• Probing polygons minimally is hard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208433)