Approximation of planar convex sets from hyperplane probes

Discrete and Computational Geometry

Volumn 18, Issue 2, 1997, Pages 151-177

  Richardson, T J ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031484729     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009313     Document Type: Article

References (21)

1. P. D. Alevizos, J. D. Boissonnat, and M. Yvinec. On the order induced by a set of rays: Application to then probing of non-convex polygons. Proc. IEEE Internat. Conf. Robotics Automat., Phoenix, AZ (1989).
2. H. J. Bernstein. Determining the shape of a convex n-sided polygon by using 2n + k tactile probes. Information Processing Letters 22, 255-260 (1986).
3. E. M. Bronštein. ε-Entropy of convex sets and functions. Siberian Mathematical Journal 17, 393-398 (1976).
4. R. Cole and C. K. Yap. Shape from probing. Journal of Algorithms 8(1), 19-38 (1987).
5. D. Dobkin, H. Edelsbrunner, and C. K. Yap. Probing convex polytopes. Proc. 18th ACM Symp. Theory of Comput., pp. 424-432 (1986).
6. R. M. Dudley. Metric entropy of some classes of sets with differentiable boundaries. Journal of Approximation Theory 10, 227-236 (1974).
7. R. M. Dudley. Uniform Central Limit Theorems. To appear.
8. H. Edelsbrunner and S. S. Skiena. Probing convex polygons with X-rays. SIAM Journal of Computing 17, 870-882 (1988).
9. J. P. Greschak. Reconstructing convex sets. Ph.D. dissertation, Dept. E.E. Comput. Sci. MIT, Cambridge, MA (1985).
10. W. E. L. Grimson and T. Lozano-Perez. Model based recognition and localization from sparse range or tactile data. International Journal of Robotics Research 3(3), 3-35 (1984).
11. P. M. Gruber. Approximation of convex bodies. In: Convexity and its Applications (P. M. Gruber and J. M. Wills, eds.). Birkäuser, Basel, pp. 131-162 (1983).
12. P. S. Kenderov. Polygonal approximation of plane convex compacts. Journal of Approximation Theory 38, 221-239 (1983).
13. S. Y. R. Li. Reconstruction of polygons from projections. Information Processing Letters 28, 235-240 (1988).
14. M. Lindenbaum and A. Bruckstein. Parallel strategies for geometric probing. Journal of Algorithms 13, 320-349 (1992).
15. M. Lindenbaum and A. Bruckstein. Blind approximation of planar convex sets. IEEE Transactions on Pattern Analysis and Machine Intelligence 10 (4), 517-529 (1994).
16. J. L. Prince and A. S. Wilsky. Reconstructing a convex set from noisy support line measurements. IEEE Transactions on Pattern Analysis and Machine Intelligence 12 (4), 377-389 (1990).
17. T. J. Richardson. Total curvature and intersection tomography. Advances in Mathematics. To appear.
18. T. J. Richardson. Planar rectifiable curves are determined by their projections. Discrete and Computational Geometry 16, 21-31 (1996).
19. L. A. Santaló. Integral Geometry and Geometric Probability. Addison-Wesley, Reading, MA (1976).
20. S. S. Skiena. Problems in geometric probing. Algorithmica 4, 599-605 (1989).
21. S. S. Skiena. Geometric probing. Ph.D. dissertation, Technical Report No. UIUCDCS-R-88-1425, Dept. Comput. Sci., University of Illinois, Urbana, IL (1988).