Search

The purpose of this paper is to describe a system of interconnected energy models. These models produce inferences that may enhance our understanding of classical and quantum mechanics. From the formulated models, an empirical test is derived to validate the proposed light projection hypothesis. [ABSTRACT FROM AUTHOR]

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 computation. The algorithm enables computation fully in the projective space using the homogeneous coordinates and the line can be given in the projective space, in general. If the result can remain in projective space, no division operation is needed. It supports the use of vector-vector operations, SSE/AVX instructions, and GPU. [ABSTRACT FROM AUTHOR]

This contribution presents a brief survey of clipping and intersection algorithms in E 2 and E 3 with a nearly complete list of relevant references. Some algorithms use the projective extension of the Euclidean space and vector-vector operations, which support GPU and SSE use. This survey is intended to help researchers, students, and practitioners dealing with intersection and clipping algorithms. [ABSTRACT FROM AUTHOR]

This contribution presents a brief survey of clipping and intersection algorithms in E 2 and E 3 with a nearly complete list of relevant references. Some algorithms use the projective extension of the Euclidean space and vector-vector operations, which support GPU and SSE use. This survey is intended to help researchers, students, and practitioners dealing with intersection and clipping algorithms. [ABSTRACT FROM AUTHOR]

The Transformation of a 2D or 3D objects are the effective means of shifting or changing the dimensions and orientations of images in the most effective way. If we fail to transform the object in terms of displacement,enlargement, orientation, we may land up in creating something that is distorted and processessing a distorted object is not acceptable in the various critical fields like Medical and Forensics. The usual practice of defining transformations is straight forward. The transformed object can be obtained by coupling original object with the transformation vectors. The main challenge is how to evaluate it. The usual practice is standard Column Vector form. The alternative Row Vector Form is also known approach but what matters is the sequence of operations that make these both approaches worth mentioning.While doing so our analysis on 3D content keeps our knowledge flawless and takes it a step further as far as Image Processing is concerned. Such analytical study is very vital since most of the content created, acquired, reproduced, and visualized in 3D needs to be mapped on to 3D. This paper describes the transformations(Translation, Scaling and Rotation) in the both Column and Row Vectar Approach. This paper aims in providing a clear sequence of calculations which differ in both approaches. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer-Aided Design & Computer Graphics / Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao is the property of Gai Kan Bian Wei Hui and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The objective of this work is twofold. One, we develop a theory of iteration for complex rational functions so that the problems of overflow and indeterminacy caused by null, or almost null, denominators can be avoided when developing implementations. Second, we present easily implementable methods that allow the calculation of attracting cycles as well as the graphical representation of their basins of attraction. In order to deal with our first goal we work with homogeneous complex coordinates and we take the complex projective line as a model, which is expressed as a quotient of the 3-sphere through the Hopf fibration. An irreducible representation of a rational function can now be presented as a Hopf fibration endomorphism. As well as our second goal is concerned, we use Lyapunov functions and exponents to calculate the cycles associated with endomorphisms and to graphically represent the corresponding basins of attraction. We point out that our algorithms are based on the calculation of a finite set of non-negative real constants and their calculation does not depend on the previous determination of the fixed points or attracting cycles. [ABSTRACT FROM AUTHOR]