Previous |  Up |  Next


Title: Testing of convex polyhedron visibility by means of graphs (English)
Author: Zámožík, Jozef
Author: Zat'ková, Viera
Language: English
Journal: Aplikace matematiky
ISSN: 0373-6725
Volume: 25
Issue: 2
Year: 1980
Pages: 81-86
Summary lang: English
Summary lang: Slovak
Summary lang: Russian
Category: math
Summary: 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. (English)
Keyword: constructive computer geometry
MSC: 51N05
MSC: 52-04
MSC: 52A10
MSC: 52A15
MSC: 52A20
MSC: 68K05
idZBL: Zbl 0435.51017
idMR: MR0560324
DOI: 10.21136/AM.1980.103842
Date available: 2008-05-20T18:13:48Z
Last updated: 2020-07-28
Stable URL:
Reference: [1] V. Medek: Über den Umriss der Konvexen Flächen.Aplikace matematiky 5 (1978), 378 - 380. Zbl 0399.51017


Files Size Format View
AplMat_25-1980-2_2.pdf 785.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo