AbstractÐThis paper discussed the problem of ®nding intersections between surfaces. Surfaces are divided into planar sub-patches, typically triangles. Triangles of one surface are tested for intersection with triangles of the second surface, one by one. The triangles are ®rst projected on a horizont
✦ LIBER ✦
Convergence of a surface/surface intersection algorithm
✍ Scribed by Gregor Müllenheim
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 522 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0167-8396
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Implementation of a polygonal algorithm
✍
Utpal Roy; V.Ramana Dasari
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 710 KB
On determining start points for a surfac
✍
Gregor Müllenheim
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 533 KB
An intersection algorithm for C2 paramet
✍
John J. Chen; Tulga M. Ozsoy
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 138 KB
Intersecting a freeform surface with a g
✍
Joon-Kyung Seong; Ku-Jin Kim; Myung-Soo Kim; Gershon Elber; Ralph R. Martin
📂
Article
📅
2005
🏛
Elsevier Science
🌐
English
⚖ 771 KB
A fast algorithm for finding the first i
✍
Daichao Sheng; Charles E. Augarde; Andrew J. Abbo
📂
Article
📅
2011
🏛
Elsevier Science
🌐
English
⚖ 726 KB
A major task in the numerical modelling of soils using complex elastoplastic material models is stress updating. This paper proposes a fast and robust numerical algorithm for locating the first intersection between a non-convex yield surface and an elastic trial stress path. The intersection problem
Predictor-corrector type of intersection
✍
J.J. Chen; T.M. Ozsoy
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 453 KB