Skip to main content
SpringerLink
Log in

A local search algorithm for ray-convex polyhedron intersection

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this paper we present a new algorithm (LSABV) for determining the intersection between a ray and a convex polyhedron (RCPI) in a fast way. LSABV is based on local search and the concept of visibility. LSABV requires only the boundary description of the polyhedron and it does not need additional data structures. Numerical experiments show that LSABV is faster than Haines’s algorithm in the case of polyhedra with moderate or large number of faces.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aronov, B., De Berg, M., Gray, Ch.: Ray shooting amidst fat convex polyhedra in 3-space. Comput. Geom. 41, 68–76 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bradford, C., Dobkin, D.P., Huhdanpaa, H.: The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22, 469–483 (1996)

    Article  MATH  Google Scholar 

  3. Besl, P.J., Jain, R.C.: Three-dimensional object recognition. Comput. Surv. 17, 75–145 (1985)

    Article  Google Scholar 

  4. Brönnimann, H., Glisse, M.: Octrees with near optimal cost for ray-shooting. Comput. Geom. 34, 182–194 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cameron, S.: A comparison of two fast algorithms for computing the distance between complex polyhedra. IEEE Trans. Robot. Autom. 13, 915–920 (1997)

    Article  Google Scholar 

  6. Devroye, L., Lemaire, Ch., Moreau, J.M.: Expected time analysis for Delaunay point location. Comput. Geom. 29, 61–89 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dobkin, D.P., Kirkpatrick, D.G.: Determining the separation of preprocessed polyhedra-a unified approach. In: Proc. 17th Internat. Colloq. Automata Lang. Program. Lecture Notes in Computer Science, vol. 443, pp. 400–413. Springer, Berlin (1990)

    Chapter  Google Scholar 

  8. Ewald, G.: Combinatorial Convexity and Algebraic Geometry. Springer, Berlin (1996)

    Book  MATH  Google Scholar 

  9. Foley, J.D., Van Dam, A., Feiner, S.K., Hughes, J.F.: Computer Graphics. Principles and Practices. Addison-Wesley, Reading (1996)

    Google Scholar 

  10. Green, P.J., Sibson, R.: Computing Dirichlet tessellations in the plane. Comput. J. 21, 168–173 (1978)

    MathSciNet  MATH  Google Scholar 

  11. Haines, E.: Fast ray-convex polyhedron intersection. In: Arvo, J. (ed.) Graphics Gems II, pp. 247–250. Morgan Kaufmann, San Mateo (1991)

    Google Scholar 

  12. Henk, M., Richter-Gebert, J., Ziegler, G.M.: Basic properties of convex polytopes. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 355–382. Chapman & Hall/CRC, London (2004)

    Google Scholar 

  13. Kay, T.L., Kajiya, J.T.: Ray Tracing complex scenes. In: Computer Graphics (SIGGRAPH’86 Proceedings), pp. 269–278. ACM, New York (1986)

    Google Scholar 

  14. Latombe, J.C.: Robot Motion Planning. Kluwer Academic, Dordrecht (1993)

    Google Scholar 

  15. Lin, M.: Efficient Collision Detection for Animation and Robotics. Ph.D. Thesis, University of California at Berkeley (1993)

  16. Llanas, B., Fernández de Sevilla, M., Feliú, V.: An iterative algorithm for finding a nearest pair of points in two convex subsets of ℝn. Comput. Math. Appl. 40, 971–983 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Llanas, B., Fernández de Sevilla, M., Feliú, V.: Minimum distance between the faces of two convex polyhedra. A sufficient condition. J. Glob. Optim. 26, 361–385 (2003)

    Article  MATH  Google Scholar 

  18. Pellegrini, M.: Ray shooting on triangles in 3-space. Algorithmica 9, 471–494 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  19. Schneider, Ph.J., Eberly, D.H.: Geometric Tools for Computer Graphics. Morgan Kaufmann, Amsterdam (2003).

    Google Scholar 

  20. Snoeyink, J.: Point location. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 767–785. Chapman & Hall/CRC, London (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemática Aplicada, ETSI de Caminos, Universidad Politécnica de Madrid, Ciudad Universitaria s/n, 28040, Madrid, Spain

    Bernardo Llanas & Francisco Javier Sáinz

Authors
  1. Bernardo Llanas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Javier Sáinz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernardo Llanas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Llanas, B., Sáinz, F.J. A local search algorithm for ray-convex polyhedron intersection. Comput Optim Appl 51, 533–550 (2012). https://doi.org/10.1007/s10589-010-9354-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-010-9354-2

Keywords

Search

Navigation