Shape from probing
From MaRDI portal
Publication:3786056
DOI10.1016/0196-6774(87)90025-3zbMath0643.68180OpenAlexW1973492835MaRDI QIDQ3786056
Richard John Cole, Chee-Keng Yap
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
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (25)
Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes ⋮ Testing geometric objects ⋮ Testing orthogonal shapes ⋮ Space exploration via proximity search ⋮ Probing a set of hyperplanes by lines and related problems ⋮ Reconstruction of polygonal sets by constrained and unconstrained double probing. ⋮ Non-convex contour reconstruction ⋮ On-line motion planning: Case of a planar rod ⋮ The complexity of oblivious plans for orienting and distinguishing polygonal parts ⋮ Probing convex polygons with a wedge ⋮ Reconstruction of polygons from projections ⋮ Learning smooth shapes by probing ⋮ How to play hot and cold ⋮ Algorithmic construction of the subdifferential from directional derivatives ⋮ Learning Polytopes with Fixed Facet Directions ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ A note on the combinatorial structure of the visibility graph in simple polygons ⋮ Search for the maximum of a random walk ⋮ Probing a scene of nonconvex polyhedra ⋮ The convergence rate of the sandwich algorithm for approximating convex functions ⋮ Testing simple polygons. ⋮ Model-based probing strategies for convex polygons ⋮ How Good is the Chord Algorithm? ⋮ EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS ⋮ Probing the arrangement of hyperplanes
This page was built for publication: Shape from probing
