On the area of overlap of translated polygons

Computer Vision and Image Understanding

Volumn 64, Issue 1, 1996, Pages 53-61

  Mount, David M ^a   Silverman, Ruth ^b,c   Wu, Angela Y ^d  

^a University of Maryland   (United States)

^b UNIVERSITY OF THE DISTRICT OF COLUMBIA   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

^d AMERICAN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CURVE FITTING; FUNCTIONS; MOTION PLANNING; OBJECT RECOGNITION; POLYNOMIALS; SET THEORY; VECTORS;

AREA OF OVERLAP FUNCTION; CONTOUR CURVES; PIECEWISE POLYNOMIAL SURFACE; WORST CASE COMPLEXITY;

COMPUTATIONAL GEOMETRY;

EID: 0030196160     PISSN: 10773142     EISSN: None     Source Type: Journal    
DOI: 10.1006/cviu.1996.0045     Document Type: Article

References (18)

1. E. Arkin, H. Meijer, J. Mitchell, D. Rappaport, and S. Skiena, Decision trees for geometric models, Proceedings 9th Annual ACM Symposium on Computer Geometry 1993, 369-378.
2. E. M. Arkin, M. T. Goodrich, J. S. B. Mitchell, D. Mount, C. D. Piatko, and S. S. Skiena, Point probe decision trees for geometric concept classes, Proceedings, 3rd Workshop on Algorithms and Data Structures Lecture Notes in Computer Science, Vol. 709, pp. 95-106, Springer-Verlag, Berlin/New York, 1993.
3. B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, J. ACM 39, 1992, 1-54.
4. R. Cole and C. K. Yap, Shape from probing, J. Algorithms 8, 1987, 19-38.
5. D. P. Dobkin, H. Edelsbrunner, and C. K. Yap, Probing convex polytopes, in Proceedings, 18th Annual ACM Symposium on Theory Computation, 1986, pp. 424-432.
6. H. Edelsbrunner and S. S. Skiena, Probing convex polygons with x-rays, SIAM J. Comput. 17, 1988, 870-882.
7. J. Hershberger and S. Suri, A pedestrian approach to ray shooting: Shoot a ray, take a walk, in Proceedings 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 54-63.
8. C. Hoffman, Geometric and Solid Modeling, Morgan Kaufmann, San Mateo, CA, 1989.
9. K. Kedem, R. Livne, J. Pach, and M. Sharir, On the union of Jordan regions and collision-free translation motion amidst polygonal obstacles, Discrete Comput. Geom. 1, 1986, 59-71.
10. J. S. B. Mitchell, D. M. Mount, and S. Suri, Query-sensitive ray shooting, in Proceedings, 10th Annual ACM Symposium on Computer Geometry 1994, 359-368.
11. D. M. Mount, The densest double-lattice packing of a convex polygon, in Discrete and Computational Geometry: Papers from the DIMACS Special Year, (J. E. Goodman, R. Pollack, and W. Steiger, Eds.), AMS, Providence, RI, 1991, 245-262.
12. D. M. Mount and R. Silverman, Packing and covering the plane with translates of a convex polygon, J. Algorithms 11, 1990, 564-580.
13. R. Pollack, M. Sharir, and S. Sifrony, Separating two simple polygons by a sequence of translations, Discrete Comput. Geom. 3, 1987, 123-136.
14. F. P. Preparate and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
15. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.
16. S. S. Skiena, Problems in geometric probing, Algorithmica 4, 1989, 599-605.
17. S. S. Skiena, Probing convex polygons with half-planes, J. Algorithms 12, 1991, 359-374.
18. S. S. Skiena, Ineractive reconstruction via geometric probing, Proc. IEEE 80, 1992, 1364-1383.