Premium
Tunnel‐Free Supercover 3D Polygons and Polyhedra
Author(s) -
Andrès Eric,
Nehlig Philippe,
Françon Jean
Publication year - 1997
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.16.3conferenceissue.2
Subject(s) - polygon (computer graphics) , polyhedron , line (geometry) , enhanced data rates for gsm evolution , plane (geometry) , computer science , combinatorics , geometry , computer graphics (images) , regular polygon , mathematics , computer vision , telecommunications , frame (networking)
A new discrete 3D line and 3D polygon, called Supercover 3D line and Supercover 3D polygon, are introduced. Analytical definitions are provided. The Supercover 3D polygon is a tunnel free plane segment defined by vertices and edges. An edge is a Supercover 3D line segment. Two different polygons can share a common edge and if they do, the union of both polygons is tunnel free. This definition of discrete polygons has the “most” properties in common with the continuous polygons. It is particularly interesting for modeling of discrete scenes, especially using tunnel‐free discrete polyhedra. Algorithms for computing Supercover 3D Lines and Polygons are given and illustrated.