On the intersection of contingent cones
✍ Scribed by V. Křivan
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 293 KB
- Volume
- 70
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A new method is suggested to compute the intersection of a set of direction cones encountered in the problem of passing a convex polyhedron through a window. The time requirement of this method is 0( nm), where n is the number of vertices of the polyhedron and m is the number of vertices of the wind
A subset S of Euclidean space is called a cone if it is the union of a set of halflines having the same endpoint called the apex of the cone, and the set of all such apices is denoted I~y ker R S and called the R-kernel or, when it does not lead to any confusion with the kernel of a starshaped set,