Distance bounds of \(\varepsilon\)-points on hypersurfaces

DOI10.1016/j.tcs.2006.05.020zbMath1099.68137OpenAlexW1990128190MaRDI QIDQ2503306

Sonia Pérez-Díaz, Juan Rafael Sendra, Sendra, Juana

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.020

zbMATH Keywords

hypersurfacesapproximation algorithmsdistance bounds\(\varepsilon\)-points

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic surfaces (14Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Approximation algorithms (68W25)

Related Items (6)

On the performance of the approximate parametrization algorithm for curves ⋮ Approximate parametrization of plane algebraic curves by linear systems of curves ⋮ An algorithm to parametrize approximately space curves ⋮ Numerical proper reparametrization of parametric plane curves ⋮ Rational Hausdorff divisors: a new approach to the approximate parametrization of curves ⋮ Almost vanishing polynomials and an application to the Hough transform

Cites Work

• Parametrization of approximate algebraic curves by lines
• Irreducible decomposition of curves
• On the numerical condition of algebraic curves and surfaces. I: Implicit equations
• Tracing surface intersections
• Parametric generalized offsets to hypersurfaces
• Parametric algebraic curves and applications. Session of the IMACS-ACA conference, University of New Mexico, Albuquerque, NM, USA, May 1995
• Certified approximate univariate GCDs
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Parameterization in finite precision
• Numerical parameterization of curves and surfaces
• Parametrization of approximate algebraic surfaces by lines
• Towards factoring bivariate approximate polynomials
• Polynomial root finding using iterated Eigenvalue computation
• Univariate polynomials
• Approximate multivariate polynomial factorization based on zero-sum relations
• A formula for separating small roots of a polynomial
• Condition numbers of a nearly singular simple root of a polynomial
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance bounds of \(\varepsilon\)-points on hypersurfaces