Shape from probing
From MaRDI portal
Publication:3786056
DOI10.1016/0196-6774(87)90025-3zbMath0643.68180MaRDI QIDQ3786056
Chee-Keng Yap, Richard John Cole
Publication date: 1987
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(87)90025-3
68Q25: Analysis of algorithms and problem complexity
68U99: Computing methodologies and applications
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
Search for the maximum of a random walk, A note on the combinatorial structure of the visibility graph in simple polygons, Learning smooth shapes by probing, Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes, Reconstruction of polygons from projections, Probing a scene of nonconvex polyhedra, The convergence rate of the sandwich algorithm for approximating convex functions, Model-based probing strategies for convex polygons, Testing geometric objects, Testing orthogonal shapes, Reconstruction of polygonal sets by constrained and unconstrained double probing., On-line motion planning: Case of a planar rod, Probing the arrangement of hyperplanes, The complexity of oblivious plans for orienting and distinguishing polygonal parts, Testing simple polygons., Non-convex contour reconstruction
