Shape from probing

DOI10.1016/0196-6774(87)90025-3MaRDI QIDQ3786056zbMATH OpenOpenAlexFDO

Authors Richard Cole, Chee K. 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

zbMATH Keywords

roboticsshape from probing

Mathematics Subject Classification ID

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

Recommendations

• Probing a scene of nonconvex polyhedra
• Reconstruction of polygons from projections
• Learning smooth shapes by probing
• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
• Model-based probing strategies for convex polygons

Cited in

(28)

• Testing simple polygons.
• Probing a set of hyperplanes by lines and related problems
• Search for the maximum of a random walk
• Intrinsic shape - the proximate approach
• On-line motion planning: Case of a planar rod
• Learning Polytopes with Fixed Facet Directions
• The complexity of oblivious plans for orienting and distinguishing polygonal parts
• The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
• Space exploration via proximity search
• Algorithmic construction of the subdifferential from directional derivatives
• On estimating local shape using contact sensing
• EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
• Learning smooth shapes by probing
• Testing geometric objects
• Probing convex polygons with a wedge
• How to play hot and cold
• Ball-Based Shape Processing
• Testing orthogonal shapes
• Non-convex contour reconstruction
• Reconstruction of polygons from projections
• Probing a scene of nonconvex polyhedra
• Model-based probing strategies for convex polygons
• Reconstruction of polygonal sets by constrained and unconstrained double probing.
• The convergence rate of the sandwich algorithm for approximating convex functions
• Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
• Probing the arrangement of hyperplanes
• A note on the combinatorial structure of the visibility graph in simple polygons
• How good is the Chord algorithm?

This page was built for publication: Shape from probing

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