Results 1 to 10 of about 3,009,375 (271)
MeshGraphNet: An Effective 3D Polygon Mesh Recognition With Topology Reconstruction
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
A New Fully Projective O(Lg N) Line Convex Polygon Intersection Algorithm
Intersecting algorithms, especially line clipping in E2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
Václav Skala
exaly +2 more sources
MobileNeRF: Exploiting the Polygon Rasterization Pipeline for Efficient Neural Field Rendering on Mobile Architectures [PDF]
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.
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
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
In this study, we first analyze the fully analytical frequency spectrum solving method based on three-dimensional affine transform. Thus, we establish a new method for combining look-up tables (LUTs) with polygon holography.
Fan Wang +4 more
semanticscholar +1 more source
Robust line-convex polygon intersection computation in E² using projective space representation
This paper describes modified robust algorithms for a line clipping by a convex polygon in E2 and a convex polyhedron in E3. The proposed algorithm is based on the Cyrus-Beck algorithm and uses homogeneous coordinates to increase the robustness of ...
Vaclav Skala
doaj +1 more source
Recognition of tennis serve performed by a digital player: comparison among polygon, shadow, and stick-figure models. [PDF]
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
Assuming a bounded polygon and a point inside the polygon or on its boundary, the visibility polygon, also called the visibility region, is a polygon reachable, i.e., visible by straight lines from the point without hitting the polygon's edges or ...
Lubomír Štěpánek +3 more
semanticscholar +1 more source

