Displaying 2041 – 2060 of 2726

Showing per page

Testing of convex polyhedron visibility by means of graphs

Jozef Zámožík, Viera Zat'ková (1980)

Aplikace matematiky

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 Banach-Tarski paradox for the hyperbolic plane (II)

Jan Mycielski, Grzegorz Tomkowicz (2013)

Fundamenta Mathematicae

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 ℍ².

Currently displaying 2041 – 2060 of 2726