Teorie Dürerovy soustavy a některých mechanických konstrukcí perspektiv a rovnoběžných projekcí
Testing of convex polyhedron visibility by means of graphs
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.
The development of the oloid.
The dynamics of two-circle and three-circle inversion
We study the dynamics of a map generated via geometric circle inversion. In particular, we define multiple circle inversion and investigate the dynamics of such maps and their corresponding Julia sets.
The future or graphical communication education in the new South Africa.