Abstract
A new discrete 3D polygon called Supercover Polygon is introduced. The polygon is a tunnel free plane segment defined by vertices and edges. An edge is a 3D line segment. Two different polygons can share a common edge and if they do, the union of both polygons is tunnel free. This is definition of discrete polygons that has the “most” properties in common with the continuous polygon. It seems particularly interesting for modelization of discrete scenes by way of digitization.
Chapter PDF
Similar content being viewed by others
References
E.ANDRES and C.SIBATA, Discrete hyperplanes in arbitrary dimensions, submitted to CVGIP-GMIP.
E.ANDRES and C.SIBATA, Choice of Integer Part Function in Computer Graphics, submitted to IEEE TVCG.
D.COHEN and A.KAUFMAN, Fundamentals of surface voxelization, CVGIP-GMIP, vol. 57, n.6, Nov.95.
A.KAUFMAN, An algorithm for 3D scan conversion of polygons, Proc. of Eurographics'87, AMSTERDAM, 1987.
J-P. Reveilles, Geometrie Discrete, calcul en nombres entiers et algorithmique, State Thesis, Universite Louis Pasteur, Strasbourg, Dec. 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andres, E., Sibata, C., Acharya, R. (1996). Supercover 3D Polygon. In: Miguet, S., Montanvert, A., Ubéda, S. (eds) Discrete Geometry for Computer Imagery. DGCI 1996. Lecture Notes in Computer Science, vol 1176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62005-2_20
Download citation
DOI: https://doi.org/10.1007/3-540-62005-2_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62005-1
Online ISBN: 978-3-540-49595-6
eBook Packages: Springer Book Archive