Offset-polygon annulus placement problems

  • Gill Barequet
  • Amy J. Briggs
  • Matthew T. Dickerson
  • Michael T. Goodrich
Session 11A: Invited Lecture
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1272)


In this paper we address several variants of the polygon annulus placement problem: given an input polygon P and a set S of points, find an optimal placement of P that maximizes the number of points in S that fall in a certain annulus region defined by P and some offset distance δ > 0. We address the following variants of the problem: placement of a convex polygon as well as a simple polygon; placement by translation only, or by a translation and a rotation; off-line and on-line versions of the corresponding decision problems; and decision as well as optimization versions of the problems: We present efFicient algorithms in each case.


optimal polygon placement tolerancing robot localization offsetting 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AAAG]
    O. Aichholzer, D. Alberts, F. Aurenhammer, and B. Gärtner, A novel type of skeleton for polygons, J. of Universal Computer Science (an electronic journal), 1 (1995), 752–761Google Scholar
  2. [AS]
    P.K. Agarwal and M. Sharir, Efficient randomized algorithms for some geometric optimization problems, Proc. 11th Ann. ACM Symp. on Computational Geometry, Vancouver, Canada, 1995, 326–335.Google Scholar
  3. [AST]
    P.K. Agarwal, M. Sharir, and S. Toledo, Applications of parametric searching in geometric optimization, J. Algorithms, 17 (1994), 292–318.Google Scholar
  4. [BDG]
    G. Barequet, M. Dickerson, and M.T. Goodrich, Voronoi diagrams for medial-axis distance functions, these proceedings, 1997.Google Scholar
  5. [BDP]
    G. Barequet, M. Dickerson, and P. Pau, Translating a convex polygon to contain a maximum number of points, Proc. 7th Canadian Conf. on Computational Geometry, Québec City, Québec, Canada, 1995, 61–66; full version to appear in: Computational Geometry: Theory and Applications.Google Scholar
  6. [Ch]
    B. Chazelle, The polygon placement problem, Advances in Computing Research: volume 1 (F. Preparata, ed.), JAI Press, 1983, 1–34.Google Scholar
  7. [CK]
    I.J. Cox and J.B. Kruskal, Determining the 2-or 3-dimensional similarity transformation between a point set and a model made of lines and arcs, Proc. 28th Conf. on Decision and Control, 1989, 1167–1172.Google Scholar
  8. [CY]
    E.-C. Chang and C.-K. Yap, Issues in the Metrology of Geometric Tolerancing, Courant Institute of Mathematical Sciences, New York University, Unpublished manuscript.Google Scholar
  9. [DGR]
    C.A. Duncan, M.T. Goodrich, and E.A. Ramos, Efficient approximation and optimization algorithms for computational metrology, Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, New Orleans, LA, 1997, to appear.Google Scholar
  10. [DS]
    M. Dickerson and D. Scharstein, Optimal placement of convex polygons to maximize point containment, Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, Atlanta, GA, 1996, 114–121.Google Scholar
  11. [DMSS]
    W.P. Dong, E. Mainsah, P.F. Sullivan, and K.F. Stout, Instruments and Measurement Techniques of 3-Dimensional Surface Topography, Three-Dimensional Surface Topography: Measurement, Interpretation and Applications (K.F. Stout, Ed.), Penton Press, Bristol, PA, 1994.Google Scholar
  12. [EE]
    D. Eppstein and J. Erickson, Iterated nearest neighbors and finding minimal polytopes, Discrete & Computational Geometry, 11 (1994) 321–350.Google Scholar
  13. [ESZ]
    A. Efrat, M. Sharir, and A. Ziv, Computing the smallest k-enclosing circle and related problems, Computational Geometry: Theory and Applications, 4 (1994), 119–136.Google Scholar
  14. [GMR]
    L. Guibas, R. Motwani, and P. Raghavan, The robot localization problem, in: Algorithmic Foundations of Robotics, A K Peters, Ltd., 1995, 269–282.Google Scholar
  15. [HT]
    M.E. Houle and G.T. Toussaint, Computing the width of a set, Proc. 1st Ann. ACM Symp. on Computational Geometry, 1985, 1–7.Google Scholar
  16. [HU]
    D.P. Huttenlocher and S. Ullman, Recognizing solid objects by alignment with an image, Int. J. of Computer Vision, 5 (1990), 195–212.Google Scholar
  17. [KS]
    D. Kirkpatrick and J. Snoeyink, Tentative prune-and-search for computing fixed-points with applications to geometric computation, Fundamental Informaticæ 22 (1995), 353–370.Google Scholar
  18. [LL]
    V.B. Le and D.T. Lee, Out-of-roundness problem revisited, IEEE Trans. on Pattern Analysis and Machine Intelligence, 13 (1991), 217–223.Google Scholar
  19. [LS]
    H.P. Lenhof and M. Smid, Sequential and parallel algorithms for the k closest pairs problem, Int. J. Computational Geometry and Applications, 5 (1995), 273–288.Google Scholar
  20. [Re]
    A.A.G. Requicha, Mathematical meaning and computational representation of tolerance specifications, Proc. Int. Forum on Dimensional Tolerancing and Metrology, 1993, 61–68.Google Scholar
  21. [SJ]
    M. Smid and R. Janardan, On the width and roundness of a set of points in the plane, Proc. 7th Canadian Conf. on Computational Geometry, Québec City, Québec, Canada, 1995, 193–198.Google Scholar
  22. [Sr]
    V. Srinivasan, Role of sweeps in tolerance semantics, Proc. Int. Forum on Dimensional Tolerancing and Metrology, 1993, 69–78.Google Scholar
  23. [SLW]
    K. Swanson, D.T. Lee, and V.L. Wu, An optimal algorithm for roundness determination on convex polygons, Computational Geometry: Theory and Applications, 5 (1995), 225–235.Google Scholar
  24. [Ya]
    C.-K. Yap, Exact computational geometry and tolerancing metrology, in: Snapshots of Computational and Discrete Geometry, Vol. 3, Technical Report SOCS-94.50 (D. Avis and J. Bose, Eds.), McGill School of Computer Science, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Gill Barequet
    • 1
  • Amy J. Briggs
    • 2
  • Matthew T. Dickerson
    • 2
  • Michael T. Goodrich
    • 1
  1. 1.Center for Geometric Computing, Dept. of Computer ScienceJohns Hopkins UniversityBaltimore
  2. 2.Department of Mathematics and Computer ScienceMiddlebury CollegeMiddlebury

Personalised recommendations