Search

In most realtime applications such as 3D games, in order to reduce the complexity of the scene being rendered, objects are often made by simple and large primitives. Thus, the phenomenon of edge highlighting, which would require chamfering structures made by lots of small patches at the seaming, is absent and is often faked by 'highlights' drawn on the texture. We proposed a realistic realtime rendering procedure for highlighting chamfering structures, or rounded edges, by considering specified edges as thin cylinders and obtained the intensity via integration. We derived a brief approximated formula generalized from Blinn's shadow model, and used a precomputed integration table to accelerate the render speed and reduce resources needed. The algorithm is implemented with shader language, and can be considered as a post-process on original result. Evaluation shows that the effect on rendering speed is limited even for scenes with large scale of vertices. [ABSTRACT FROM AUTHOR]

It is a fundamental problem to calculate Jacobian coefficients of constraint equations in assembly constraint solving because most approaches to solving an assembly constraint system will finally resort to a numerical iterative method that requires the first-order derivatives of the constraint equations. The most-used method of deriving the Jacobian coefficients is to use virtual rotation which is originally presented to derive the equations of motion of constrained mechanical systems. However, when Euler parameters are adopted as the state variables to represent the transformation matrix, using the virtual rotation will yield erroneous formulae of Jacobian coefficients. The reason is that Euler parameters are incompatible with virtual rotation. In this paper, correct formulae of Jacobian coefficients of geometric constraints with respect to Euler parameters are presented in both Cartesian coordinates and relative generalized coordinates. Experimental results show that our proposed formulae make Newton-Raphson iterative method converge faster and more stable. [ABSTRACT FROM AUTHOR]

Assembly data exchange and reuse play an important role in CAD and CAM in shortening the product development cycle. However, current CAD systems cannot transfer mating conditions via neutral file format, and their exported IGES files are heterogeneous. In this paper, a schema for the full data exchange of assemblies is presented based on IGES. We first design algorithms for the pre-and-post processors of parts based on solid model, in which the topologies are explicitly specified and will be referred by mating conditions, and then extend the IGES schema by introducing the Associativity Definition Entity and Associativity Instance Entity defined in IGES standard, so as to represent mating conditions. Finally, a production rule-based method is proposed to analyze and design the data exchange algorithms for assemblies. Within this schema, the heterogeneous representations of assemblies exported from different CAD systems can be processed appropriately, and the mating conditions can be properly exchanged. Experiments on the prototype system verify the robustness, correctness, and flexibility of our schema. [ABSTRACT FROM AUTHOR]

How to obtain intersection of curves and surfaces is a fundamental problem in many areas such as computer graphics, CAD/CAM, computer animation, and robotics. Especially, how to deal with singular cases, such as tangency or superposition, is a key problem in obtaining intersection results. A method for solving the intersection problem based on the coordinate transformation is presented. With the Lagrange multiplier method, the minimum distance between the center of a circle and a quadric surface is given as well. Experience shows that the coordinate transformation could significantly simplify the method for calculating intersection results. The location of the tangent point is revised according to the tangency condition. It can improve the stability of the intersection of given curves and surfaces in singularity cases. The new algorithm is applied in a three dimensional CAD software (GEMS), produced by Tsinghua University. [ABSTRACT FROM AUTHOR]

A method for computing the visible regions of free-form surfaces is proposed in this paper. Our work is focused on accurately calculating the visible regions of the sequenced rational Bézier surfaces forming a solid model and having coincident edges but no inner-intersection among them. The proposed method calculates the silhouettes of the surfaces without tessellating them into triangle meshes commonly used in previous methods so that arbitrary precision can be obtained. The computed silhouettes of visible surfaces are projected onto a plane orthogonal to the parallel light. Then their spatial relationship is applied to calculate the boundaries of mutual-occlusion regions. As the connectivity of the surfaces on the solid model is taken into account, a surface clustering technique is also employed and the mutual-occlusion calculation is accelerated. Experimental results showed that our method is efficient and robust, and can also handle complex shapes with arbitrary precision. [ABSTRACT FROM AUTHOR]