Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A, Hopcroft J, Ullman J (1974) The design and analysis of computer algorithms. Addison-Wesley, Reading, Mass
Abhyankar S, Bajaj C (1988) Automatic parameterization of rational curves and surfaces III: algebraic braic plane curves. Comput-Aided Geom Des 5:309–321
Abhyankar S, Bajaj C (1989) Automatic parameterization of rational curves and surfaces IV: algebraic space curves. ACM Trans Graphics 8:325–334
Bajaj C, Hoffmann C, Hopcroft J, Lynch R (1988) Tracing surface intersections. Comput-Aided Geom Des 5:285–307
Bentley JL, Ottmann TA (1979) Algorithms for reporting and counting geometric intersections. IEEE Trans on Computers C-28:643–647
Canny JF (1987) The complexity of robot motion planning. PhD thesis, Massachusetts Institute of Technology
Dobkin DP, Thurston WP, Wilks AR (1986) Robust contour tracing. Tech Rep CS-TR-054-86, Princeton University
Edelsbrunner H (1987) Algorithms in combinatorial geometry. Springer, New York
Garrity T, Warren J (1989) On computing the intersection of a pair of algebraic surfaces. Comput-Aided Geom Des 6:137–153
Hoffmann CM (1987) Algebraic curves. Tech Rep CSD-TR-675, Purdue University
Johnstone JK (1987) The sorting of points along an algebraic curve. Tech Rep 87-841; PhD Thesis, Cornell University
Johnstone JK, Bajaj C (1990) Sorting points along an algebraic curve. SIAM J Computing 19:925–967
McKenna M (1987) Worst-case optimal hidden-surface removal. ACM Trans Graphics 6:19–28
Mortenson ME (1985) Geometric modeling. Wiley, New York
Owen JC, Rockwood AP (1987) Intersection of general implicit surfaces. In: Farin G (ed) Geometric modeling: algorithms and new trends. SIAM, Philadelphia, pp 335–345
Pedersen P (1990) Generalizing Sturm's theorem ton dimensions. Talk at the DIMACS Workshop on Algebraic Issues in Geometric Computation, Rutgers University, May 21–25
Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, New York
Requicha AAG (1980) Representations for rigid solids: theory, methods, and systems. Computing Surveys 12:437–464
Sakkalis T (1989) Signs of algebraic numbers. In: Kaltofen E, Watt S (eds) Computers and mathematics. Springer, New York, 130–134
Sechrest S, Greenberg DP (1982) A visibility polygon reconstruction algorithm. ACM Trans Graphics 1:25–42
Sederberg TW, Anderson DC, Goldman RN (1984) Implicit representation of parametric curves and surfaces. Computer Vision, Graphics, and Image Processing 28:72–84
Timmer HG (1977) Analytical background for computation of surface intersections. Douglas Aircraft Company Technical Memorandum C1-250-CAT-77-036, cited in Mortenson 1985
Van der Waerden BL (1953) Modern Algebra. Frederick Ungar, New York
Walker RJ (1950) Algebraic curves. Springer, New York
Author information
Authors and Affiliations
Additional information
This author's research was supported by the National Science Foundation under Grant IRI-8910366
This author's research was supported by the National Science Foundation under Grant CCR-8810568
Rights and permissions
About this article
Cite this article
Johnstone, J.K., Goodrich, M.T. A localized method for intersecting plane algebraic curve segments. The Visual Computer 7, 60–71 (1991). https://doi.org/10.1007/BF01901177
Issue Date:
DOI: https://doi.org/10.1007/BF01901177