Testing geometric objects
From MaRDI portal
Publication:1328754
DOI10.1016/0925-7721(94)90005-1zbMath0807.68104OpenAlexW2107025376MaRDI QIDQ1328754
Publication date: 3 August 1994
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(94)90005-1
Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (7)
Testing orthogonal shapes ⋮ Exact learning from an honest teacher that answers membership queries ⋮ On specifying Boolean functions by labelled examples ⋮ Approximate testing and its relationship to learning ⋮ Testing simple polygons. ⋮ Exact Learning of Discretized Geometric Concepts ⋮ The Vapnik-Chervonenkis dimension of a random graph
Cites Work
- Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
- \(\epsilon\)-nets and simplex range queries
- Reconstruction of polygons from projections
- Model-based probing strategies for convex polygons
- Probing polygons minimally is hard
- Probing convex polygons with half-planes
- Shape from probing
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: Testing geometric objects
