The Visual Computer

, Volume 7, Issue 2–3, pp 60–71 | Cite as

A localized method for intersecting plane algebraic curve segments

  • J. K. Johnstone
  • M. T. Goodrich


We present a local method for the computation of the intersections of plane algebraic curve segments. The conventional method of intersection is global, because it must first find all of the intersections between two curves before it can restrict the segments in question; hence, it cannot take advantage of situations dealing with the intersection of short-curve segments on complex curves. Our local method, on the other hand, will directly find only those intersections that lie on the segments, as it is based upon an extension of methods for tracing along a curve.

Key words

Intersection Algebraic curves Curve tracing Plane sweep Resultants Theory of elimination Geometric modeling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aho, A, Hopcroft J, Ullman J (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading, MassGoogle Scholar
  2. Abhyankar S, Bajaj C (1988) Automatic parameterization of rational curves and surfaces III: algebraic braic plane curves. Comput-Aided Geom Des 5:309–321CrossRefGoogle Scholar
  3. Abhyankar S, Bajaj C (1989) Automatic parameterization of rational curves and surfaces IV: algebraic space curves. ACM Trans Graphics 8:325–334CrossRefGoogle Scholar
  4. Bajaj C, Hoffmann C, Hopcroft J, Lynch R (1988) Tracing surface intersections. Comput-Aided Geom Des 5:285–307CrossRefGoogle Scholar
  5. Bentley JL, Ottmann TA (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans on Computers C-28:643–647Google Scholar
  6. Canny JF (1987) The complexity of robot motion planning. PhD thesis, Massachusetts Institute of TechnologyGoogle Scholar
  7. Dobkin DP, Thurston WP, Wilks AR (1986) Robust contour tracing. Tech Rep CS-TR-054-86, Princeton UniversityGoogle Scholar
  8. Edelsbrunner H (1987) Algorithms in combinatorial geometry. Springer, New YorkGoogle Scholar
  9. Garrity T, Warren J (1989) On computing the intersection of a pair of algebraic surfaces. Comput-Aided Geom Des 6:137–153CrossRefGoogle Scholar
  10. Hoffmann CM (1987) Algebraic curves. Tech Rep CSD-TR-675, Purdue UniversityGoogle Scholar
  11. Johnstone JK (1987) The sorting of points along an algebraic curve. Tech Rep 87-841; PhD Thesis, Cornell UniversityGoogle Scholar
  12. Johnstone JK, Bajaj C (1990) Sorting points along an algebraic curve. SIAM J Computing 19:925–967CrossRefGoogle Scholar
  13. McKenna M (1987) Worst-case optimal hidden-surface removal. ACM Trans Graphics 6:19–28CrossRefGoogle Scholar
  14. Mortenson ME (1985) Geometric modeling. Wiley, New YorkGoogle Scholar
  15. Owen JC, Rockwood AP (1987) Intersection of general implicit surfaces. In: Farin G (ed) Geometric modeling: algorithms and new trends. SIAM, Philadelphia, pp 335–345Google Scholar
  16. Pedersen P (1990) Generalizing Sturm's theorem ton dimensions. Talk at the DIMACS Workshop on Algebraic Issues in Geometric Computation, Rutgers University, May 21–25Google Scholar
  17. Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, New YorkGoogle Scholar
  18. Requicha AAG (1980) Representations for rigid solids: theory, methods, and systems. Computing Surveys 12:437–464CrossRefGoogle Scholar
  19. Sakkalis T (1989) Signs of algebraic numbers. In: Kaltofen E, Watt S (eds) Computers and mathematics. Springer, New York, 130–134Google Scholar
  20. Sechrest S, Greenberg DP (1982) A visibility polygon reconstruction algorithm. ACM Trans Graphics 1:25–42CrossRefGoogle Scholar
  21. Sederberg TW, Anderson DC, Goldman RN (1984) Implicit representation of parametric curves and surfaces. Computer Vision, Graphics, and Image Processing 28:72–84Google Scholar
  22. Timmer HG (1977) Analytical background for computation of surface intersections. Douglas Aircraft Company Technical Memorandum C1-250-CAT-77-036, cited in Mortenson 1985Google Scholar
  23. Van der Waerden BL (1953) Modern Algebra. Frederick Ungar, New YorkGoogle Scholar
  24. Walker RJ (1950) Algebraic curves. Springer, New YorkGoogle Scholar

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • J. K. Johnstone
    • 1
  • M. T. Goodrich
    • 1
  1. 1.Department of Computer ScienceThe Johns Hopkins UniversityBaltimoreUSA

Personalised recommendations