Skip to main content
SpringerLink
Log in

A Point Inclusion Test Algorithm for Simple Polygons

  • Conference paper
Book cover Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3480))

Included in the following conference series:

Abstract

An algorithm for testing the relationship of a point and a simple polygon is presented. The algorithm employs a “visible edge” of the polygon from the point to determine whether the point is in the polygon or not according to the relationship of the orientation of the polygon and the triangle formed by the point and the visible edge. The algorithm is efficient and robust for floating point computation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anglada, M.V.: Improved incremental algorithm for constructing restricted Delaunay triangulations. Computers & Graphics 21, 215–223 (1997)

    Article  Google Scholar 

  2. Balbes, R., Siegel, J.: A robust method for calculating the simplicity and orientation of planar polygons. Computer Aided Geometric Design 8, 327–335 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Edelsbrunner, H., Mücke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9, 66–104 (1990)

    Google Scholar 

  4. Feito, F., Torres, J.C.: Inclusion test for general polyhedra. Computers & Graphics 21, 23–30 (1997)

    Google Scholar 

  5. Feito, F., Torres, J.C., Urena, A.: Orientation, simplicity, and inclusion test for planar polygons. Computers & Graphics 19, 595–600 (1995)

    Article  Google Scholar 

  6. Forrest, A.R.: Computational geometry in practice. In: Earnshaw, E.A. (ed.) Fundamental Algorithms for Computer Graphics, pp. 707–724. Springer, Berlin (1985)

    Google Scholar 

  7. Haines, E.: Point in polygon straegies. In: Heckbert, P. (ed.) Graphic Gems IV, pp. 24–46. Academic Press, Boston (1994)

    Google Scholar 

  8. Hoffmann, C.M.: The problem of accuracy and robustness in geometric computation. IEEE Computer 22, 31–41 (1989)

    Google Scholar 

  9. O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  10. Preparata, F.P., Shamos, M.I.: Computational Geometry - An Introduction. Springer, New York (1985)

    Google Scholar 

  11. Weiler, K.: An incremental angle point in polygon test. In: Heckbert, P. (ed.) Graphic Gems IV, pp. 16–23. Academic Press, Boston (1994)

    Google Scholar 

  12. Wu, H.Y., Gong, J.Y., Li, D.R., Shi, W.Z.: An algebraic algorithm for point inclusion query. Computers & Graphics 24, 517–522 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of High Performance Computing, 1 Science Park Road, #01-01, The Capricorn, Science Park II, 117528, Singapore

    Weishi Li, Eng Teo Ong, Shuhong Xu & Terence Hung

Authors
  1. Weishi Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eng Teo Ong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuhong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Terence Hung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W, T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, P.O. Box, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, P.O. Box, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, W., Ong, E.T., Xu, S., Hung, T. (2005). A Point Inclusion Test Algorithm for Simple Polygons. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_79

Download citation

  • DOI: https://doi.org/10.1007/11424758_79

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32043-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation