A linear-time construction of Reuleaux polygons.
Page 1
Kupitz, Yaakov, Martini, Horst, Wegner, Bernd (1996)
Beiträge zur Algebra und Geometrie
J.S. Chang, C.K. Yap (1986)
Discrete & computational geometry
D. Kölzow, A. Kuba, A. Volcic (1989)
Discrete & computational geometry
Vladimir Bulatov (2001)
Visual Mathematics
U. Betke, M. Henk (1993)
Discrete & computational geometry
D. Avis (1986)
Discrete & computational geometry
Kurz, Sascha (2007)
Journal of Integer Sequences [electronic only]
D.T. Lee, A.K. Lin (1986)
Discrete & computational geometry
Nilakantan, Nandini (2003)
Experimental Mathematics
R. Seidel, J. Ruppert (1992)
Discrete & computational geometry
N.J.A. Sloane, R.L. Graham (1990)
Discrete & computational geometry
Francis Avnaim, Jean-Daniel Boissonnat (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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.
F. Hermeline (1982)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Page 1