4.4 Article

A line/trimmed NURBS surface intersection algorithm using matrix representations

Journal

COMPUTER AIDED GEOMETRIC DESIGN
Volume 48, Issue -, Pages 1-16

Publisher

ELSEVIER
DOI: 10.1016/j.cagd.2016.07.002

Keywords

Line/trimmed NURBS intersection; Matrix based implicit representation; Meshing NURBS surfaces; Delaunay refinement

Funding

  1. Engineering and Physical Sciences Research Council [EP/E025889/1, EP/H030115/1] Funding Source: researchfish
  2. EPSRC [EP/H030115/1, EP/E025889/1] Funding Source: UKRI

Ask authors/readers for more resources

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 algebra such as singular value decomposition and the computation of generalized eigenvalues and eigenvectors. A careful treatment of degenerate cases makes our approach robust to intersection points with multiple pre-images. We then apply our intersection algorithm to mesh NURBS surfaces through Delaunay refinement. We demonstrate the added value of our approach in terms of accuracy and treatment of degenerate cases, by providing comparisons with other intersection approaches as well as a variety of meshing experiments. (C) 2016 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available