Testing of convex polyhedron visibility by means of graphs

Zámožík, Jozef, and Zat'ková, Viera. "Testing of convex polyhedron visibility by means of graphs." Aplikace matematiky 25.2 (1980): 81-86. <http://eudml.org/doc/15134>.

@article{Zámožík1980,
abstract = {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.},
author = {Zámožík, Jozef, Zat'ková, Viera},
journal = {Aplikace matematiky},
keywords = {constructive computer geometry},
language = {eng},
number = {2},
pages = {81-86},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Testing of convex polyhedron visibility by means of graphs},
url = {http://eudml.org/doc/15134},
volume = {25},
year = {1980},
}

TY - JOUR
AU - Zámožík, Jozef
AU - Zat'ková, Viera
TI - Testing of convex polyhedron visibility by means of graphs
JO - Aplikace matematiky
PY - 1980
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 25
IS - 2
SP - 81
EP - 86
AB - 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.
LA - eng
KW - constructive computer geometry
UR - http://eudml.org/doc/15134
ER -