Supercover 3D polygon. (English) Zbl 1541.68378
Miguet, Serge (ed.) et al., Discrete geometry for computer imagery. 6th international workshop, DGCI ’96, Lyon, France, November 13–15, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1176, 237-242 (1996).
Summary: 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.
For the entire collection see [Zbl 0856.00050].
For the entire collection see [Zbl 0856.00050].
MSC:
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
References:
| [1] | E.ANDRES and C.SIBATA, Discrete hyperplanes in arbitrary dimensions, submitted to CVGIP-GMIP. |
| [2] | E.ANDRES and C.SIBATA, Choice of Integer Part Function in Computer Graphics, submitted to IEEE TVCG. |
| [3] | D.COHEN and A.KAUFMAN, Fundamentals of surface voxelization, CVGIP-GMIP, vol. 57, n.6, Nov.95. |
| [4] | A.KAUFMAN, An algorithm for 3D scan conversion of polygons, Proc. of Eurographics’87, AMSTERDAM, 1987. |
| [5] | J-P. Reveilles, Geometrie Discrete, calcul en nombres entiers et algorithmique, State Thesis, Universite Louis Pasteur, Strasbourg, Dec. 1991. · Zbl 1079.51513 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
