Testing geometric objects
From MaRDI portal
Publication:1328754
DOI10.1016/0925-7721(94)90005-1zbMATH Open0807.68104OpenAlexW2107025376MaRDI QIDQ1328754FDOQ1328754
Authors: V. Pereyra 
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- \(\epsilon\)-nets and simplex range queries
- Shape from probing
- Reconstruction of polygons from projections
- Probing convex polygons with half-planes
- Probing polygons minimally is hard
- Determining the shape of a convex n-sided polygon by using \(2n+k\) tactile probes
- Model-based probing strategies for convex polygons
Cited In (13)
- Testing simple polygons.
- Approximate testing and its relationship to learning
- Testing congruence and symmetry for general 3-dimensional objects.
- Exact learning from an honest teacher that answers membership queries
- The VC dimension of quadratic residues in finite fields
- Testing the quality of manufactured disks and balls
- Testing orthogonal shapes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Vapnik-Chervonenkis dimension of a random graph
- Title not available (Why is that?)
- Exact Learning of Discretized Geometric Concepts
- On specifying Boolean functions by labelled examples
This page was built for publication: Testing geometric objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328754)
