𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Topological properties of the intersection graph of covers of n-dimensional surfaces

✍ Scribed by Alexander V. Evako

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
620 KB
Volume
147
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the intersection of edges of a geomet
On the intersection of edges of a geometric graph by straight lines
✍ N. Alon; M.A. Perles πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 969 KB

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0

A compact algorithm for the intersection
A compact algorithm for the intersection and approximation of N-dimensional polytopes
✍ V. Broman; M.J. Shensa πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 885 KB

In a very general sense, estimation problems are concerned with relating measurements to a (hopefully small) region containing the unknown state or parameters. Polytopes present a natural candidate for the representation and manipulation of such regions. In fact, assuming the existence of a suitable