Results 211 to 220 of about 97,053 (258)
Some of the next articles are maybe not open access.
Optics Express, 2021
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
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
Application of Region Division in Self Intersecting Polygon Decomposition Algorithm
Journal of Computer-Aided Design & Computer Graphics, 2023: Polygon decomposition has been widely employed in the fields of computer graphics, CAD software, and path planning. The presence of self-intersections in polygons introduces errors and inaccuracies in subsequent computations and drawing operations ...
Qi Zhao, Wei Zeng, Yijun Yang
semanticscholar +1 more source
Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference, 1988
The 4D-MP graphics superworkstation, which brings 40 MIPS (million instructions per second) of computing performance to a graphics superworkstation is described. It also delivers 40 MFLOPS (million floating-point operations per second) of geometry processing performance, enabling 100000 lighted, four-sided, concave-tested polygons to be processed per ...
F. Baskett, T. Jermoluk, D. Solomon
openaire +1 more source
The 4D-MP graphics superworkstation, which brings 40 MIPS (million instructions per second) of computing performance to a graphics superworkstation is described. It also delivers 40 MFLOPS (million floating-point operations per second) of geometry processing performance, enabling 100000 lighted, four-sided, concave-tested polygons to be processed per ...
F. Baskett, T. Jermoluk, D. Solomon
openaire +1 more source
Computation of penetration measures for convex polygons and polyhedra for graphics applications
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238), 2002Algorithms to compute measures of penetration between convex polygonal objects in /spl Rfr//sup 2/ and convex polyhedral objects in /spl Rfr//sup 3/ are presented. The algorithms are analyzed for their asymptotic complexity. Details of implementation on a single processor machine are given. Parallelization of the algorithms is discussed.
openaire +1 more source
A Virtual Reality Platform for Immersive Education in Computer Graphics
, 2021Filip Hácha, Petr Vanecek, L. Váša
semanticscholar +1 more source
An efficient algorithm to clip a 2D-polygon against a rectangular clip window
Applied Mathematics-A Journal of Chinese Universities, 2022S. Dimri, U. Tiwari, M. Ram
semanticscholar +1 more source
A clipping algorithm on vector graphics based on non-intersect polygon boundary
2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference, 2016Dingding Yang +3 more
semanticscholar +1 more source