An efficient method for simulating cartoon style rain in 3D environment is proposed here. By taking advantage of the parallelism and programmability of GPUs (graphic processing units), real-time interaction can be achieved. Splashing of raindrop is simulated using collision detection, series of stylized textures and rotations of point sprites. To simulate wind-driven raining effect, the motion of particles can be freely controlled based on Newtonian dynamics. We can also control the size of raindrops dynamically by using different textures or changing the size of point sprites. Many experiments have been done in 3D scenes with different complexity and GPU-based stylized rendering. The experimental results demonstrated the efficiency of our method for real-time rain simulation in cartoon style with complex geometries of 3D scenes.

CAD systems increasingly require distributed collaborative design capabilities to meet the designers at different geographical locations to co-develop parts. It involves transmitting the CAD models back and forth among the systems in a distributed design environment. However, it is very difficult to apply because the CAD models are always very complex and the current network bandwidth is limited. In this paper, some important work about the compression and transmission of CAD models through the network is elaborated. Meanwhile, because a feature-based model always contains many extruded and revolved features, then we propose a new approach to transmission of feature-based models to deal with these extruded and revolved features. This approach can effectively cut down the transmission delay of the feature-based models, especially when the model contains many extruded and revolved features.

We present an efficient method for simulation of raining phenomenon in real time by taking advantage of the parallelism and programmability of GPU (graphic processing unit). Our implementation of the method is based on particle systems and collision detection. Splashing of raindrop is simulated using a series of stylized textures and rotations of point sprites. Taking into account human perception in raining phenomenon of real world, the effects such as light influence, depth of field, motion blur, have been applied. The test results show that our method is efficient and is feasible to solve the problem of 3D raining simulation in real time for more general environment with complex geometry.

Most of current collaborative feature modeling systems use the token-passing method as its collaborative strategy that makes the collaborative design between multi-clients inflexible and inefficient. Based on the analysis of feature operation in collaborative environment, we propose a new method to solve the concurrency conflicts, an enhanced naming mechanism for collaborative feature modeling to preserve the design intensions, and a process for non-locked multi-client collaborative design. The algorithms have been implemented in a prototype system integrating C++, Java3D and VML, CORBA technologies. Flexibility and efficiency in collaborative feature modeling environment have been achieved in our system.

The authors present a method that can produce traditional proofs for a class of geometry statements whose hypotheses can be described constructively and whose conclusions can be represented by polynomial equations of three kinds of geometry quantities: ratios of lengths, areas of triangles, and Pythagoras differences of triangles. This class covers a large portion of the geometry theorems about straight lines and circles. The method involves the elimination of the constructed points from the conclusion using a few basic geometry propositions. The authors' program, Euclid, implements this method and can produce traditional proofs of many hard geometry theorems. Currently, it has produced proofs of 400 nontrivial theorems entirely automatically, and the proofs produced are generally short and readable. This method seems to be the first one to produce traditional proofs for hard geometry theorems efficiently.>

Article Free Access Share on Solving parametric algebraic systems Authors: Xiao-Shan Gao View Profile , Shang-Ching Chou View Profile Authors Info & Claims ISSAC '92: Papers from the international symposium on Symbolic and algebraic computationAugust 1992 Pages 335–341https://doi.org/10.1145/143242.143348Published:01 August 1992Publication History 30citation303DownloadsMetricsTotal Citations30Total Downloads303Last 12 Months16Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Abstract. We present a complete method of implicitization for general rational parametric equations. We also present a method to decide whether the parameters of a set of parametric equations are independent, and if not, reparameterize the parametric equations so that the new parametric equations have independent parameters. We give a method to compute the inversion maps of parametric equations with independent parameters, and as a consequence, we can decide whether the parametric equations are proper. A new method to find a proper reparameterization for a set of improper parametric equations of algebraic curves is presented. 1

This is an overview of the applications of the characteristic set method and the Gröbner basis method to automated reasoning in elementary geometries, differential geometries, and mechanics. Though I shall try to be objective, it will reflect mainly my knowledge of the subject.

A precise formulation for the relations among certain variables under a set of polynomial equations and a set of polynomial inequations (to exclude certain special cases which cannot be excluded by the selection of parameters alone) is given. Several methods are presented to find such relations. The methods have been implemented and used to find geometry formulas, to discover geometry theorems, and to find geometry locus equations. About 120 non-trivial problems have been solved using the methods.