We contribute a reliable line/surface intersection method for trimmed NURBS surfaces,
based on a novel matrix-based implicit representation and numerical methods in linear …

We present an efficient algorithm to compute the intersection of algebraic and NURBS
surfaces. Our approach is based on combining the marching methods with the algbraic …

We present an efficient and robust algorithm for computing the self-intersection of a freeform
surface, based on a special representation of miter points, using sufficiently small …

Trimmed B-spline surfaces are common in the geometric computer aided design (CAD)
community due to their capability to represent complex shapes that can not be modeled with …

Solid Modeling requires robust and efficient surface intersection algorithms that handle a
very general class of surfaces, including rational Bezier and B-spline surfaces. Currently …

We present an efficient and robust algorithm for computing the intersection curve of two
freeform surfaces using a Bounding Volume Hierarchy (BVH), where the leaf nodes contain …

An algorithm for obtaining a piecewise triangular approximation of a trimmed NURBS
surface is presented. The algorithm is geometry based, ie the surface is subdivided into …

An automatic mesh generation scheme with unstructured quadrilateral elements on trimmed
NURBS surfaces has been developed. In this paper NURBS surface geometries in the IGES …

This work draws upon a recent result (Pekerman et al., 2008)[3] on self-intersection
detection and elimination for planar curves, which attempted to eliminate redundant …

In most cad systems, a trimmed parametric surface is defined by two things: the control
information of the surface itself and the control information of its trimming curves, which are …