Ternary halfgroupoids and coordinatization (Preliminary communication)
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 second author found a gap in the proof of the main theorem in [J. Mycielski, Fund. Math. 132 (1989), 143-149]. Here we fill that gap and add some remarks about the geometry of the hyperbolic plane ℍ².