A Simple and Efficient Algorithm for Line and Polygon Clipping in 2-D Computer Graphics
International Journal of Computer Applications, 2015 most popular lines clipping algorithms are Cohen- Sutherland and Liang-Barsky line clipping algorithm. These algorithms are complex and the steps of calculation are very high. This paper proposes a simple new line clipping algorithm for 2D space which uses the parametric equation of the line.
Sushil Chandra
semanticscholar +4 more sources
Polygon mesh modelling for computer graphics
, 1988 Bibliography: p. 115-119.
Jeffrey B. Allan
semanticscholar +5 more sources
Computer Graphics: Recognition and Representation of a Hierarchy of Polygons with Holes [PDF]
The Computer Journal, 1989 Modelisation des proprietes geometriques et topologiques d'un ensemble d'entites de surface statiques.
Mahes Visvalingam, P. Wade, G. H. Kirby
openaire +3 more sources
Computer Graphics: On the Conversion of Filled Polygonal Regions from Raster to Vector Representation [PDF]
The Computer Journal, 1989 Il est montre que la conversion de la representation pixel a la representation vectorielle des motifs de remplissage permet de «remplir» des regions polygonales arbitraires avec une bonne ...
J.R. Parker
openaire +3 more sources
Computer Graphics of the Regular Polygons and their Applications
KnE Engineering, 2018 Abstract. The computer graphics of regular polygons and their applications is a scarcely studied area that allows to create situations of significant learning by its mathematical and geometric content. This research presents the design and programming of regular polygons and composite sacred figures using computational analytical geometry and ...
Ramiro Benavides +7 more
openaire +3 more sources
MeshGraphNet: An Effective 3D Polygon Mesh Recognition With Topology Reconstruction
IEEE Access, 2020 Three-dimensional polygon mesh recognition has a significant impact on current computer graphics. However, its application to some real-life fields, such as unmanned driving and medical image processing, has been restricted due to the lack of inner ...
An Ping Song +3 more
doaj +2 more sources
Areas of lattice polygons, applied to computer graphics [PDF]
Applicationes Mathematicae, 1987 John Robert Reay, Ren Ding
openaire +3 more sources
MobileNeRF: Exploiting the Polygon Rasterization Pipeline for Efficient Neural Field Rendering on Mobile Architectures [PDF]
Computer Vision and Pattern Recognition, 2022 Neural Radiance Fields (NeRFs) have demonstrated amazing ability to synthesize images of 3D scenes from novel views. However, they rely upon specialized volumetric rendering algorithms based on ray marching that are mismatched to the capabilities of ...
Zhiqin Chen +3 more
semanticscholar +1 more source
Fast shadow casting algorithm in analytical polygon-based computer-generated holography.
Optics Express, 2023 Shadow casting is essential in computer graphics, which can significantly enhance the reality of rendered images. However, shadow casting is rarely studied in polygon-based computer-generated holography (CGH) because state-of-art triangle-based occlusion
Jiaqi Dong, Bo-Ru Yang, Zong Qin
semanticscholar +1 more source
Line Clipping in 2D: Overview, Techniques and Algorithms
Journal of Imaging, 2022 Clipping, as a fundamental process in computer graphics, displays only the part of a scene which is needed to be displayed and rejects all others. In two dimensions, the clipping process can be applied to a variety of geometric primitives such as points,
Dimitrios Matthes, Vasileios Drakopoulos
doaj +1 more source