Testing simple polygons

Computational Geometry: Theory and Applications

Volumn 8, Issue 2, 1997, Pages 97-114

  Arkin, Esther M ^a   Belleville, Patrice ^b   Mitchell, Joseph S B ^a   Mount, David ^c   Romanik, Kathleen ^d   Salzberg, Steven ^e   Souvaine, Diane ^f  

^a Stony Brook University   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c University of Maryland ^*  (United States)

^d UNIVERSITY OF MARYLAND   (United States)

^e Johns Hopkins University   (United States)

^f RUTGERS UNIVERSITY   (United States)

Author keywords

Probing; Testing; Verifying

Indexed keywords

EID: 0343411878     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00015-6     Document Type: Article

References (11)

1. P. Belleville and T.C. Shermer, Probing polygons minimally is hard, Computational Geometry 2 (1993) 255-265.
2. R. Cole and C.K. Yap, Shape from probing, J. Algorithms 8 (1) (1987) 19-38.
3. W.C. Karl, Reconstructing objects from projections, Ph.D. thesis, Department of EECS, Massachusetts Institute of Technology, Boston, MA (1991).
4. K.A. Lyons and D. Rappaport, An efficient algorithm for identifying objects using robot probes, The Visual Computer 10 (1994) 452-458.
5. J.S.B. Mitchell, Algorithmic computer vision - the probing paradigm, prepared for the Workshop on Geometric Probing and Computer Vision (November 1990).
6. K. Romanik, Approximate testing theory, Ph.D. thesis, University of Maryland at College Park, College Park, MD (1992); also: Technical Report CS-TR-2947/UMIACS-TR-92-89.
7. K. Romanik and S. Salzberg, Testing orthogonal shapes, Computational Geometry 5 (1995) 33-49.
8. K. Romanik and C. Smith, Testing geometric objects, Computational Geometry 4 (1994) 157-176.
9. W. Rudin, Real and Complex Analysis (McGraw-Hill, New York, 1966).
10. S. Skiena, Geometric probing, Ph.D. thesis, University of Illinois at Urbana-Champaign, Urbana, IL (1988).
11. S. Skiena, Interactive reconstruction via geometric probing, Proc. IEEE 80 (9) (1992) 1364-1383.