Displaying similar documents to “A graphical way to solve the Boolean matrix equations A X = B and X A = B ”

Testing of convex polyhedron visibility by means of graphs

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.