Computation of Adjoints for Surfaces

Project: Funded researchFWF - Austrian Science Fund

Project Details

Description

The goal is to devise an efficient algorithm for the following problem. Given implicitly a surface in 3-space, and two integers n,m, we want to compute the m-adjoints of degree n of the surface. Such an m-adjoint is a polynomial of degree n that vanishes with a certain order (depending on m) on the singularities of the surface. Computation of adjoints is important because it is currently the only way to solve the parameterization problem, which is essential to compute NURBS-representations, which have numerous applications in CAD/CAM.
StatusFinished
Effective start/end date01.01.199830.04.2000

Funding

  • FWF

Fields of science

  • 101013 Mathematical logic
  • 101001 Algebra
  • 101012 Combinatorics
  • 101020 Technical mathematics
  • 101 Mathematics
  • 101009 Geometry
  • 101005 Computer algebra

JKU Focus areas

  • Digital Transformation