β Scribed by Kai Tang
No coin nor oath required. For personal study only.
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 window. Besides this time improvement, the concept of parallel congruence, which the new method is crucially based on, is discussed.
π SIMILAR VOLUMES
## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~β{1, β¦, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only
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,