Model-based probing strategies for convex polygons
From MaRDI portal
(Redirected from Publication:1208433)
Recommendations
- Probing convex polygons with half-planes
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- An improved on-line strategy for exploring unknown polygons
- Non-interactive geometric probing: Reconstruction non-convex polygons
- scientific article; zbMATH DE number 701117
- Probing convex polygons with a wedge
- Fast computation of the modality of polygons
- Probing a scene of nonconvex polyhedra
Cites work
- An Optimal-Time Algorithm for Slope Selection
- Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
- Non-convex contour reconstruction
- Probing convex polygons with half-planes
- Reconstruction of polygons from projections
- Shape from probing
- The maximum number of unit distances in a convex n-gon
Cited in
(8)- Shape from probing
- Decision Trees for Geometric Models
- Testing geometric objects
- Point probe decision trees for geometric concept classes
- Reconstruction of polygons from projections
- Probing a scene of nonconvex polyhedra
- Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
- Probing polygons minimally is hard
This page was built for publication: Model-based probing strategies for convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208433)