The following pages link to Shape from probing (Q3786056):
Displaying 25 items.
- Space exploration via proximity search (Q312150) (← links)
- Probing convex polygons with a wedge (Q340529) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- Learning smooth shapes by probing (Q871061) (← links)
- Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes (Q1075786) (← links)
- Reconstruction of polygons from projections (Q1114932) (← links)
- Probing a scene of nonconvex polyhedra (Q1194334) (← links)
- The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962) (← links)
- Model-based probing strategies for convex polygons (Q1208433) (← links)
- Testing geometric objects (Q1328754) (← links)
- Testing orthogonal shapes (Q1346252) (← links)
- Reconstruction of polygonal sets by constrained and unconstrained double probing. (Q1354096) (← links)
- On-line motion planning: Case of a planar rod (Q1356165) (← links)
- Probing the arrangement of hyperplanes (Q1842647) (← links)
- The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
- How to play hot and cold (Q2173459) (← links)
- Algorithmic construction of the subdifferential from directional derivatives (Q2413566) (← links)
- Testing simple polygons. (Q2482903) (← links)
- Non-convex contour reconstruction (Q2638822) (← links)
- How Good is the Chord Algorithm? (Q2816293) (← links)
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS (Q3636313) (← links)
- Search for the maximum of a random walk (Q4697818) (← links)
- Probing a set of hyperplanes by lines and related problems (Q5060099) (← links)
- Learning Polytopes with Fixed Facet Directions (Q6161562) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)