A hybrid method for computing the intersection and tangency points of plane curves

DOI10.1016/J.AMC.2012.08.039MaRDI QIDQ2250221zbMATH OpenOpenAlexFDO

Authors D. S. Triantafyllou, Dimitrios Christou, Antonios Danelakis, Marilena Mitrouli

Publication date 4 July 2014

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.08.039

zbMATH Keywords

complexityinversionimplicitizationSylvester matrixtangency pointscurve intersectionroot specification

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• Computing curve intersection by means of simultaneous iterations
• scientific article; zbMATH DE number 6836855
• Intersections of rational parametrized plane curves
• Computing curve intersection by homotopy methods
• Computing numerical singular points of plane algebraic curves

Cites work

• scientific article; zbMATH DE number 1716506 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• A Hybrid Approach for Normal Factorization of Polynomials
• A family of third-order methods to solve nonlinear equations by quadratic curves approximation
• A new source of structured singular value decomposition problems
• An application of fast factorization algorithms in computer aided geometric design
• An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
• Basin attractors for various methods for multiple roots
• Basins of attraction for several methods to find simple roots of nonlinear equations
• Blending implicit interval curves and surfaces
• Efficient Groebner walk conversion for implicitization of geometric objects
• Fast computation of determinants of Bézout matrices and application to curve implicitization
• Greatest common divisors from generalized sylvester resultant matrices
• Numerical Analysis and Its Applications
• Numerical and symbolical methods for the GCD of several polynomials
• Numerical linear algebra and applications
• On rank and null space computation of the generalized Sylvester matrix
• Partial singular value decomposition algorithm
• Stability Issues in the Factorization of Structured Matrices
• Structured matrix-based methods for polynomial -gcd: analysis and comparisons
• Superfast algorithms for Cauchy-like matrix computations and extensions
• The ERES method for computing the approximate GCD of several polynomials
• Tracing index of rational curve parametrizations
• Using polynomial interpolation for implicitizing algebraic curves
• Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves

Cited in

(5)

• Computer Algebra in Scientific Computing
• Tides and angular momentum redistribution inside low-mass stars hosting planets: a first dynamical model
• Computer graphics techniques in military applications
• scientific article; zbMATH DE number 6836855 (Why is no real title available?)
• Automated Deduction in Geometry

This page was built for publication: A hybrid method for computing the intersection and tangency points of plane curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250221)