Representing rational curve segments and surface patches using semi-algebraic sets
From MaRDI portal
Publication:2010339
DOI10.1016/j.cagd.2019.101770zbMath1439.65024OpenAlexW2969297921MaRDI QIDQ2010339
Yifei Feng, Sonia Pérez-Díaz, Li-Yong Shen, Ronald N. Goldman
Publication date: 27 November 2019
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10017/41550
Numerical smoothing, curve fitting (65D10) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical radial basis function approximation (65D12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the number of roots of a polynomial in a plane region using the winding number
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- Computing real roots of real polynomials
- \(\mu \)-bases and singularities of rational planar curves
- Implicitization using univariate resultants
- Homeomorphic approximation of the intersection curve of two rational surfaces
- Subdivision methods for solving polynomial equations
- Algorithm for implicitizing rational parametric surfaces
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Selfintersection of composite curves and surfaces
- Geometric conditions of non-self-intersecting NURBS surfaces
- Residue and implicitization problem for rational surfaces
- The \(\mu \)-basis and implicitization of a rational parametric surface
- Computation of the singularities of parametric plane curves
- The μ-basis of a planar rational curve—properties and computation
- Radial Basis Functions
- Computing the singularities of rational surfaces
- Theoretically Based Robust Algorithms for Tracking Intersection Curves of Two Deforming Parametric Surfaces
- Rectangular corner cutting and Dixon \({\mathcal A}\)-resultants
This page was built for publication: Representing rational curve segments and surface patches using semi-algebraic sets