Abstract
In this paper we present an approach to describe polyhedra by meshes of discrete triangles. The study is based on the theory of arithmetic geometry [10]. We introduce a new class of discrete planes (respectively lines) which we call graceful planes (respectively graceful lines).We use naive planes and graceful lines to obtain as thin as possible triangular mesh discretization admitting an analytical description. The interiors of the triangles are portions of naive planes, while the sides are graceful lines
Chapter PDF
Similar content being viewed by others
References
Andres, E., Acharya, R., Sibata, C.: Discrete Analytical Hyperplanes. GMIP59 (1997) 302–309
Andres, E., Jacob, M.-A.: The Discrete Analytical Hyperspheres. IEEE TVCG3 (1997) 75–86
Andres, E., Nehlig, Ph., Françon, J.: Supercover of Straight Lines, Planes, and Triangles. In: Ahronovitz, E., Fiorio, Ch. (eds.): Discrete Geometry for Computer Imagery. Springer-Verlag, Berlin Heidelberg New York (1996) 243–254
Bresenham, J.E.: Algorithm for Computer Control of a Digital Plotter. ACM Trans. on Graphics4 (1965) 25–30
Barneva, R.P., Brimkov, V.E., Nehlig, Ph.: Thin Discrete Triangular Meshes. Tech. Rep. RR 98/01, LSIIT, Strasbourg (1998). To appear in Theor. Comp. Sc. (Elsevier)
Debled-Renesson, I.: Reconnaissance des Droites et Plans Discrets. Thèse de doctorat, Université Louis Pasteur, Strasbourg (1995)
Debled-Renesson, I., Reveillès, J.-P.: A New Approach to Digital Planes. In: Spie’s International Symposium on Photonics for Industrial Applications, Technical Conference Vision Geometry 3, Boston (1994)
Figueiredo, O., Reveillès, J.-P.: A Contribution to 3D Digital Lines. In: Discrete Geometry for Computer Imagery, 5th Int.Workshop, Clermont-Ferrand (1995) 187–198
Françon J.: On Recent Trends in Discrete Geometry in Computer Imagery. In: Miguet, S., Montanvert, A., Ubeda, S. (eds.): Discrete Geometry for Computer Imagery. Lecture Notes in Computer Sciences, Vol. 1176. Springer-Verlag, Berlin Heidelberg New York (1996) 141–150
Reveillès, J.-P.: Géométrie Discréte, Calcul en Nombres Entiers et Algorithmique. Thèse d’état, Universitè Louis Pasteur, Strasbourg (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brimkov, V.E., Barneva, R.P. (1999). Graceful Planes and Thin Tunnel-Free Meshes. In: Bertrand, G., Couprie, M., Perroton, L. (eds) Discrete Geometry for Computer Imagery. DGCI 1999. Lecture Notes in Computer Science, vol 1568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49126-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-49126-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65685-2
Online ISBN: 978-3-540-49126-2
eBook Packages: Springer Book Archive
