The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we deal with the method of grid generation. From the perspective of deformation mechanics, we propose a new method to generate grid with boundary constrain. Based on the stress balance equation on the node of the domain, the coordinate of the balance particle can be easily obtained by a very simple iteration method. Moreover, some discussions about the free parameters are conducted,...
A new method for constructing polynomial interpolation surface on triangulations is given. Triangulating the given data points into triangle network, and the surface patch on each triangle is constructed by the weighted combination of three cubic patches, each of which interpolates the three vertices of the triangle and is C1 continue on one edge respectively. All triangle patches are put together...
We develop a polygonal mesh simplification algorithm using a vertex decimation approach. The novelty in our method lies in (a) a characterization of mesh vertices as hyperbolic or nonhyperbolic based upon their discrete local geometry, (b) the cost function used to select a vertex for decimation, and (c) the heuristics applied to re-triangulate the resulting hole. The algorithm begins by classifying...
In architectural and mechanical engineering, man-made CAD models often have some prominent contours and regular shapes. These features are important to the visual perception. Traditional mesh simplification methods are not very suitable for this kind of models because in the simplified results some important mini structures and shape regularities are always missed. In this paper, we propose a new...
We present a fast GPU-based algorithm to approximate the swept volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume swept by an object along a trajectory, the efficient algorithms described have imposed constraints on both the trajectories and geometric models. By proposing a general algorithm that handles flat surfaces as well as volumes...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.