Reconstruction of polygonal sets by constrained and unconstrained double probing.

DOI10.1007/BF01531064zbMath1034.68561MaRDI QIDQ1354096

Michael Lindenbaum, Alfred Marcel Bruckstein

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

convex planar polygons

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Probing convex polygons with a wedge

Cites Work

• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
• Reconstruction of polygons from projections
• Shape from probing