𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the intersection of a set of direction cones

✍ Scribed by Kai Tang


Publisher
Elsevier Science
Year
1988
Weight
95 KB
Volume
43
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the intersection of a set of directio
✍ Kai Tang πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science βš– 312 KB

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

On set intersection representations of g
✍ Stasys Jukna πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 193 KB πŸ‘ 1 views

## 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

Intersection formulae for the kernel of
✍ J. Cel πŸ“‚ Article πŸ“… 1991 πŸ› Springer 🌐 English βš– 468 KB

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,

On families of intersecting sets
✍ Andrzej Ehrenfeucht; Jan Mycielski πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 81 KB