Convergence of a surface/surface intersection algorithm

IGES (Initial Graphics Exchange Standard) is a general graphics data exchange standard, which has been widely used for data exchange between different CAD/CAM systems. But the inherent defect of IGES makes it difficult to use in the field of automatic programming. This article focuses on the automatic programming of holes processing. Entities were labeled with different entity number, on which the hole entity could be distinguished and extracted based. The intersection lines of hole and NURBS surface could be calculated by NURBS surface intersection algorithm. The redundancy of intersecting lines is a key problem. This article gives an intuitive treatment.

Download Full-text

An efficient surface intersection algorithm based on lower-dimensional formulation

ACM Transactions on Graphics ◽

10.1145/237748.237751 ◽

1997 ◽

Vol 16 (1) ◽

pp. 74-106 ◽

Cited By ~ 76

Author(s):

Shankar Krishnan ◽

Dinesh Manocha

Keyword(s):

Surface Intersection ◽

Intersection Algorithm ◽

Lower Dimensional

Download Full-text

Properties of Polynomial Bases Used in a Line-Surface Intersection Algorithm

Parallel Processing and Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14390-8_38 ◽

2010 ◽

pp. 369-378

Author(s):

Gun Srijuntongsiri ◽

Stephen A. Vavasis

Keyword(s):

Surface Intersection ◽

Intersection Algorithm ◽

Polynomial Bases

Download Full-text

Parametric Surface Intersections for Geometric Modeling

18th Design Automation Conference: Volume 2 — Geometric Modeling, Mechanisms, and Mechanical Systems Analysis ◽

10.1115/detc1992-0167 ◽

1992 ◽

Author(s):

J.-M. Chen ◽

Yu Wang ◽

E. L. Guroz ◽

Fritz B. Prinz

Keyword(s):

Geometric Modeling ◽

Parametric Surface ◽

Parametric Surfaces ◽

B Spline ◽

Surface Intersection ◽

Spline Surfaces ◽

Intersection Algorithm ◽

Intersection Curves ◽

Surface Intersections

Abstract A surface-surface intersection algorithm is an important element in the development of a geometric modeler. This paper presents a new algorithm for calculating the intersection curves of two parametric surfaces. Combining the merits of subdivision and global exploration methods, this algorithm is efficient and robust in dealing with the issues related to small loops and singularities. This algorithm is demonstrated with examples of non-uniform rational B-spline surfaces.

Download Full-text