An algebraic framework for computing the topology of offsets to rational curves
From MaRDI portal
Publication:2357689
DOI10.1016/j.cagd.2017.03.007zbMath1366.65017OpenAlexW2598005548MaRDI QIDQ2357689
Mario Fioravanti, Jorge Caravantes, Laureano Gonzalez-Vega, Gema Maria Diaz Toca, Ioana Necula
Publication date: 14 June 2017
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2017.03.007
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Solving bivariate systems using rational univariate representations
- Exact symbolic-numeric computation of planar algebraic curves
- Efficient offset trimming for planar rational curves using biarc trees
- A new method to compute the singularities of offsets to rational plane curves
- Solving the implicitization, inversion and reparametrization problems for rational curves through subresultants
- Topology of 2D and 3D rational curves
- Algebraic properties of plane offset curves
- Bezout matrices, subresultant polynomials and parameters
- A new approach for constructing subresultants
- Good global behavior of offsets to plane algebraic curves
- Pythagorean-hodograph curves. Algebra and geometry inseparable
- Partial degree formulae for plane offset curves
- A spline approximation of offset curves
- Genus formula for generalized offset curves
- Computation of singularities and intersections of offsets of planar curves
- Rationality of the offsets to algebraic curves and surfaces
- An overview of offset curves and surfaces.
- Computing offsets of NURBS curves and surfaces.
- Algebraic analysis of offsets to hypersurfaces
- Degree formulae for offset curves
- Efficient topology determination of implicitly defined algebraic plane curves.
- Rational parametrization of quadrics and their offsets
- Reducibility of offsets to algebraic curves
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- Analytic properties of plane offset curves
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
- D-resultant and subresultants
- Computer Algebra in Scientific Computing
