Skip to main content
Log in

Homogeneous bounding boxes as tools for intersection algorithms of rational bézier curves and surfaces

  • Original Articles
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

In the divide-and-conquer algorithm for detecting intersections of parametric rational Bézier curves (surfaces), we use bounding boxes in recursive rough checks. In this paper, we replace the conventional bounding box with a homogeneous bounding box, which is projectively defined. We propose a new rough check algorithm based on it. One characteristic of the homogeneous bounding box is that it contains a rational Bézier curve (surface) with weights of mixed signs. This replacement of the conventional bounding box by the homogeneous one does not increase the computation time.

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

Access this article

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

  • Barnhill RE, Kersey SN (1990) A marching method for parametric surface/surface intersection. Comput Aided Geom Design 7:257–280

    Google Scholar 

  • Busemann H, Kelly PJ (1953) Projective geometry and projective metrics. Academic Press, New York

    Google Scholar 

  • Coxeter HSM (1968) Non-euclidean geometry, 4th edn. University of Tronto Press, Toronto

    Google Scholar 

  • Houghton EG, Emnett RF, Factor JD, Sabharwal CL (1985) Implementation of a divide-and-conquer method for intersection of parametric surfaces. Comput Aided Geom Design 2:173–183

    Google Scholar 

  • Lane JM, Riesenfeld RF (1980) A theoretical development for the computer generation and display of piecewise polynomial surfaces. IEEE Trans Patt Anal Machine Intel 2:35–46

    Google Scholar 

  • Piegl L (1986) The sphere as a rational Bézier surface. Comput Aided Geom Design 3:45–52

    Google Scholar 

  • Piegl L (1987a) On the use of infinite control points in CAGD. Comput Aided Geom Design 4:155–166

    Google Scholar 

  • Piegl L (1987b) Less data for shapes. IEEE Comput Graph Appl 7:48–50

    Google Scholar 

  • Sederberg TW, Parry SR (1986) Comparison of three curve intersection algorithms. Comput Aided Design 18:58–63

    Google Scholar 

  • Wang G (1984) The subdivision method for finding the intersection between two Bézier curves or surfaces. Special Issue on Computational Geometry, Zhejiang Univ, Journal (in Chinese)

  • Yamada A, Matsumura K, Yamaguchi F (1995) Interference processing of rational curves and surfaces using a homogeneous geometric Newton method. Journal of the Japan Society for Precision Engineering 61:203–208

    Google Scholar 

  • Yamaguchi F (1988) Curves and surfaces in computer aided geometric design. Springer, Berlin Heidelberg New York

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Atsushi Yamada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamada, A., Yamaguchi, F. Homogeneous bounding boxes as tools for intersection algorithms of rational bézier curves and surfaces. The Visual Computer 12, 202–214 (1996). https://doi.org/10.1007/BF01782323

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01782323

Key words

Navigation