Directed graphs and matrix equations
Juraj Bosák (1978)
Mathematica Slovaca
Similarity:
Juraj Bosák (1978)
Mathematica Slovaca
Similarity:
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
Krieger, Wolfgang, Matsumoto, Kengo (2003)
Documenta Mathematica
Similarity:
Wu, Chai Wah (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jozef Zámožík, Viera Zat'ková (1980)
Aplikace matematiky
Similarity:
This paper follows the article by V. Medek which solves the problem of finding the boundary of a convex polyhedron in both parallel and central projections. The aim is to give a method which yields a simple algorithm for the automation of an arbitrary graphic projection of a convex polyhedron. Section 1 of this paper recalls some necessary concepts from the graph theory. In Section 2 graphs are applied to determine visibility of a convex polyhedron.
Neel, David L., Orrison, Michael E. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: