The Bernstein polynomial basis: A centennial retrospective
RT Farouki - Computer Aided Geometric Design, 2012 - Elsevier
One hundred years after the introduction of the Bernstein polynomial basis, we survey the
historical development and current state of theory, algorithms, and applications associated …
historical development and current state of theory, algorithms, and applications associated …
A review of trimming in isogeometric analysis: challenges, data exchange and simulation aspects
B Marussig, TJR Hughes - Archives of computational methods in …, 2018 - Springer
We review the treatment of trimmed geometries in the context of design, data exchange, and
computational simulation. Such models are omnipresent in current engineering modeling …
computational simulation. Such models are omnipresent in current engineering modeling …
Geometric constraint solver using multivariate rational spline functions
We present a new approach to building a solver for a set of geometric constraints
represented by multivariate rational functions. The constraints are formulated using …
represented by multivariate rational functions. The constraints are formulated using …
Subdivision methods for solving polynomial equations
B Mourrain, JP Pavone - Journal of Symbolic Computation, 2009 - Elsevier
This paper presents a new algorithm for solving a system of polynomials, in a domain of Rn.
It can be seen as an improvement of the Interval Projected Polyhedron algorithm proposed …
It can be seen as an improvement of the Interval Projected Polyhedron algorithm proposed …
An algorithm for the medial axis transform of 3D polyhedral solids
EC Sherbrooke, NM Patrikalakis… - IEEE transactions on …, 1996 - ieeexplore.ieee.org
The medial axis transform (MAT) is a representation of an object which has been shown to
be useful in design, interrogation, animation, finite element mesh generation, performance …
be useful in design, interrogation, animation, finite element mesh generation, performance …
[图书][B] Solving transcendental equations: the Chebyshev polynomial proxy and other numerical rootfinders, perturbation series, and oracles
JP Boyd - 2014 - SIAM
The goal of this book is to teach the art of finding the root of a single algebraic equation or a
pair of such equations. We shall quote theorems and theory as necessary, but this is not …
pair of such equations. We shall quote theorems and theory as necessary, but this is not …
Analysis and applications of pipe surfaces
A pipe (or tubular) surface is the envelope of a one-parameter family of spheres with
constant radii r and centers C (t). In this paper we investigate necessary and sufficient …
constant radii r and centers C (t). In this paper we investigate necessary and sufficient …
Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis
We introduce optimal quadrature rules for spline spaces that are frequently used in Galerkin
discretizations to build mass and stiffness matrices. Using the homotopy continuation …
discretizations to build mass and stiffness matrices. Using the homotopy continuation …
Cut locus and medial axis in global shape interrogation and representation
FE Wolter - 1993 - repository.library.noaa.gov
The cut locus C, of a closed set A in the Euclidean space E is defined as the closure of the
set containing all points p which have at least two shortest paths to A. We present a theorem …
set containing all points p which have at least two shortest paths to A. We present a theorem …
Continuous collision detection for ellipsoids
We present an accurate and efficient algorithm for continuous collision detection between
two moving ellipsoids. We start with a highly optimized implementation of interference …
two moving ellipsoids. We start with a highly optimized implementation of interference …