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, based on quadric error metrics, we present an hybrid approach to optimize triangulation created from implicit surface with sharp features. The approach first uses a resampling process to update vertices positions of initial triangulation. A dual mesh of the triangulation is at the same time constructed to restrict the updated positions and to project the new positions onto the implicit...
In this paper, we present an effective parallel algorithm for polygonizing implicit surfaces. The algorithm can produces triangulation approximation of implicit surface with adaptive size of triangles according to the local curvature of the surface. Our algorithm first divides an given implicit surface into eight parts by subdividing its bounding box. Then, the algorithm finds a seed point for each...
Planar parameterization of triangular meshes is an essential problem of Digital Geometry Processing, especially for texture mapping, remeshing and mesh editing. This paper investigates the latest theoretical and practical results on planar parameterization. Comparisons of several important algorithms on their theoretical basis, complexity, applied environments and numerical implementations are presented...
In this paper, we present a general and robust algorithm to remesh triangular meshes with genus-0 topology based on their geometric properties. Our algorithm first parameterizes an given original mesh onto planar area, and creates several geometry images for it according to its intrinsic geometric properties, e.g. per-vertex density, per-face normal or texture, etc. Then the algorithm replaces the...
In this paper, we present an efficient algorithm to generate tetrahedral meshes from surface models. Our algorithm first subdivides the axis-aligned bounding box of a surface model into a number of uniform tetrahedra, and then generates an initial indention mesh after removing all the tetrahedra outside the surface model by employing a signed distance function, defined by the vertices of the surface...
Based on spherical parameterization, we in this paper present an algorithm to naturally morph a mesh model to another. Our algorithm first adjusts poses of both the models to align them in 3D space. Then, the two normalized models are parameterized onto a common spherical parametrical domain. Subsequently, the algorithm matches a group of given features of the models on spherical domain via a re-parameterizing...
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.