Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds [PDF]
Algorithms, 2021 Recently, there has been renewed interest in signed distance bound representations due to their unique properties for 3D shape modelling. This is especially the case for deep learning-based bounds.
Nenad Markuš, Mirko Sužnjević
doaj +2 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
Line Clipping in 2D: Overview, Techniques and Algorithms [PDF]
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 +2 more sources
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
openaire +3 more sources
Polygon mesh modelling for computer graphics
, 1988 Bibliography: p. 115-119.
Jeffrey B. Allan
openaire +4 more sources
Areas of lattice polygons, applied to computer graphics [PDF]
Applicationes Mathematicae, 1987 John Robert Reay, Ren Ding
openaire +3 more sources
A Graphical Framework to Study the Correlation between Geometric Design and Simulation [PDF]
Smart Tools and Applications in Graphics - Eurographics Italian
Chapter Conference 2022, 2021 Partial differential equations can be solved on general polygonal and polyhedral meshes, through Polytopal Element Methods (PEMs). Unfortunately, the relation between geometry and analysis is still unknown and subject to ongoing research in order to identify weaker shape-regularity criteria under which PEMs can reliably work.
arxiv +1 more source
Recognition of tennis serve performed by a digital player: comparison among polygon, shadow, and stick-figure models. [PDF]
PLoS ONE, 2012 The objective of this study was to assess the cognitive effect of human character models on the observer's ability to extract relevant information from computer graphics animation of tennis serve motions.
Hirofumi Ida +2 more
doaj +1 more source