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
On determining start points for a surface/surface intersection algorithm
✍ Scribed by Gregor Müllenheim
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 533 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0167-8396
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
Monte-Carlo simulations are frequently employed to study samples that emit radiation. Often the first step in such a simulation is to generate a distribution of points in the sample volume or on a sample surface such that radiation emanates from each point. In this work a method is given in which a
Most factorial experiments in industrial research form one stage in a sequence of experiments and so considerable prior knowledge is often available from earlier stages. A Bayesian A-optimality criterion is proposed for choosing designs, when each stage in experimentation consists of a small number