Article
MSC:
51N05,
52-04,
52A10,
52A15,
52A20,
68K05 | MR 0560324 | Zbl 0435.51017 | DOI: 10.21136/AM.1980.103842
Full entry |
PDF
(0.7 MB)
Feedback
PDF
(0.7 MB)
Feedback
Keywords:
constructive computer geometry
constructive computer geometry
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.
References:
[1] V. Medek: Über den Umriss der Konvexen Flächen. Aplikace matematiky 5 (1978), 378 - 380. Zbl 0399.51017
Search
Partner of
