A line/trimmed NURBS surface intersection algorithm using matrix representations
DOI10.1016/j.cagd.2016.07.002zbMath1366.65045OpenAlexW2395070421WikidataQ59750803 ScholiaQ59750803MaRDI QIDQ2357617
Jingjing Shen, Laurent Busé, Pierre Alliez, Neil A. Dodgson
Publication date: 14 June 2017
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01268109v2/file/nurbsmesh-final.pdf
algorithmsingular value decompositionDelaunay refinementgeneralized eigenvalues and eigenvectorsline/surface intersection methodline/trimmed NURBS intersectionmatrix based implicit representationmeshing NURBS surfaces
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fitting ideals and multiple points of surface parameterizations
- Curve intersection using Bézier clipping
- Finding intersections of B-spline represented geometries using recursive subdivision techniques
- Tessellating trimmed NURBS surfaces
- Ray tracing of spline surfaces: Bézier clipping, Chebyshev boxing, and bounding volume hierarchy - a critical comparison with new results
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Conversion of trimmed NURBS surfaces to Catmull-Clark subdivision surfaces
- Curve/surface intersection problem by means of matrix representations
- Delaunay Mesh Generation
- Gmsh: A 3-D finite element mesh generator with built-in pre- and post-processing facilities
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- A mapping-independent primitive for the triangulation of parametric surfaces
- Provably good sampling and meshing of surfaces
This page was built for publication: A line/trimmed NURBS surface intersection algorithm using matrix representations