Skip to main content
SpringerLink
Log in

Approximating vertices of a convex polygon with grid points in the polygon

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 650))

Included in the following conference series:

Abstract

In this paper, we consider the problem of approximating a vertex of a convex polygon by an integer point in the polygon. We show that the nearest grid point in a convex polygon to a vertex can be found if it exists, or decided to be nonexistent, in time O(n+logl), where l is the diameter of the polygon and n is the number of the polygon's vertices. The underlying technique used is the continued fraction expansion.

This research work was partially supported by the National Science Council of the Republic of China under grant No. NSC80-0408-E009-03.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. H. Greene and F. F. Yao, Finite-resolution computational geometry, Proc. 27th Symposium on Foundations of Computer Science, pp. 143–152, 1986.

    Google Scholar 

  2. H. S. Lee and R. C. Chang, Hitting Grid Points in a Convex Polygon with Straight Lines, Lecture Notes in Computer Science (ISA '91 Algorithms), Vol. 557, pp. 176–189, Springer-Verlag, 1991.

    Google Scholar 

  3. H. S. Lee and R. C. Chang, A Fast Algorithm for Weber Problem on a Grid, Techn. Rep., Science and Info. Engineering, NCTU, Taiwan, 1991.

    Google Scholar 

  4. W. J. LeVeque, Fundamentals of Number Theory, Addison-Wesley, 1977.

    Google Scholar 

  5. L. Lovasz, An Algorithmic Theory of Numbers, Graphs and Complexity, Society for Industrial and Applied Mathematics, Pennsylvania, 1986.

    Google Scholar 

  6. S. Mehta, M. Mukherjee and G. Nagy, Constrained integer approximation to 2-D line intersections, Second Canadian Conf. on Computational Geometry, Ottawa, Canada, August 1990, 302–305.

    Google Scholar 

  7. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Ming Chuan College, 250 Chungshan N. Rd., Sec. 5, Taipei, Taiwan, 11120, Republic of China

    H. S. Lee

  2. Institute of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, 30050, Republic of China

    R. C. Chang

Authors
  1. H. S. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. C. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. S. Lee .

Editor information

Toshihide Ibaraki Yasuyoshi Inagaki Kazuo Iwama Takao Nishizeki Masafumi Yamashita

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, H.S., Chang, R.C. (1992). Approximating vertices of a convex polygon with grid points in the polygon. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_80

Download citation

  • DOI: https://doi.org/10.1007/3-540-56279-6_80

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56279-5

  • Online ISBN: 978-3-540-47501-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation