Examinando por Materia "Superficies NURBS"
Mostrando 1 - 6 de 6
Resultados por página
Opciones de ordenación
Ítem Adaptative cubical grid for isosurface extraction(2009) Congote, John; Moreno, Aitor; Barandiaran, Iñigo; Barandiaran, Javier; Ruíz, Óscar E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical quality using the same grid size -- The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved -- After each iteration, the difference between the implicit and the explicit representations are reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more detailed, as the results shall confirm -- The proposed algorithm corrects some topological problems that may appear in the discretisation process using the original gridÍtem A curvature-sensitive parameterization-independent triangulation algorithm(2008-09) Ruíz, Óscar; Congote, John; Cadavid, Carlos; Lalinde, Juan G.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAETriangulations of a connected subset F of parametric surfaces S(u,v) (with continuity C2 or higher) are required because a C0 approximation of such F(called a FACE) is widely required for finite element analysis, rendering, manufacturing, design, reverse engineering, etc -- The triangulation T is such an approximation, when its piecewise linear subsets are triangles (which, on the other hand, is not a compulsory condition for being C0) -- A serious obstacle for algorithms which triangulate in the parametric space u−v is that such a space may be extremely warped, and the distances in parametric space be dramatically different of the distances in R3 -- Recent publications have reported parameter -independent triangulations, which triangulate in R3 space -- However, such triangulations are not sensitive to the curvature of the S(u,v) -- The present article presents an algorithm to obtain parameter-independent, curvature-sensitive triangulations -- The invariant of the algorithm is that a vertex v of the triangulation if identified, and a quasiequilateral triangulation around v is performed on the plane P tangent to S(u,v) at v -- The size of the triangles incident to v is a function of K(v), the curvature of S(u,v) at v -- The algorithm was extensively and successfully tested, rendering short running times, with very demanding boundary representationsÍtem Gabriel-constrained Parametric Surface Triangulation(2008-10) Ruíz, Óscar E.; Cadavid, Carlos; Lalinde, Juan G.; Serrano, Ricardo; Peris-Fajarnés, Guillermo; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThe Boundary Representation of a 3D manifold contains FACES (connected subsets of a parametric surface S : R2−R3) -- In many science and engineering applications it is cumbersome and algebraically difficult to deal with the polynomial set and constraints (LOOPs) representing the FACE -- Because of this reason, a Piecewise Linear (PL) approximation of the FACE is needed, which is usually represented in terms of triangles (i.e. 2-simplices) -- Solving the problem of FACE triangulation requires producing quality triangles which are: (i) independent of the arguments of S, (ii) sensitive to the local curvatures, and (iii) compliant with the boundaries of the FACE and (iv) topologically compatible with the triangles of the neighboring FACEs -- In the existing literature there are no guarantees for the point (iii) -- This article contributes to the topic of triangulations conforming to the boundaries of the FACE by applying the concept of parameter independent Gabriel complex, which improves the correctness of the triangulation regarding aspects (iii) and (iv) -- In addition, the article applies the geometric concept of tangent ball to a surface at a point to address points (i) and (ii) -- Additional research is needed in algorithms that (i) take advantage of the concepts presented in the heuristic algorithm proposed and (ii) can be proved correctÍtem Geodesic-based manifold learning for parameterization of triangular meshes(Springer Verlag, 2014) Acosta, Diego A.; Ruíz, Óscar E.; Arroyave, Santiago; Ebratt, Roberto; Cadavid, Carlos; Londono, Juan J.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEReverse Engineering (RE) requires representing with free forms (NURBS, Spline, Bézier) a real surface which has been pointsampled -- To serve this purpose, we have implemented an algorithm that minimizes the accumulated distance between the free form and the (noisy) point sample -- We use a dualdistance calculation point to / from surfaces, which discourages the forming of outliers and artifacts -- This algorithm seeks a minimum in a function that represents the fitting error, by using as tuning variable the control polyhedron for the free form -- The topology (rows, columns) and geometry of the control polyhedron are determined by alternative geodesicbased dimensionality reduction methods: (a) graphapproximated geodesics (Isomap), or (b) PL orthogonal geodesic grids -- We assume the existence of a triangular mesh of the point sample (a reasonable expectation in current RE) -- A bijective composition mapping allows to estimate a size of the control polyhedrons favorable to uniformspeed parameterizations -- Our results show that orthogonal geodesic grids is a direct and intuitive parameterization method, which requires more exploration for irregular triangle meshes -- Isomap gives a usable initial parameterization whenever the graph approximation of geodesics on be faithful -- These initial guesses, in turn, produce efficient free form optimization processes with minimal errors -- Future work is required in further exploiting the usual triangular mesh underlying the point sample for (a) enhancing the segmentation of the point set into faces, and (b) using a more accurate approximation of the geodesic distances within , which would benefit its dimensionality reductionÍtem Marching cubes in an unsigned distance field for surface reconstruction from unorganized point sets(2010) Congote, John; Moreno, Aitor; Barandiaran, Iñigo; Barandiaran, Javier; Posada, Jorge; Ruíz, Óscar; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAESurface reconstruction from unorganized point set is a common problem in computer graphics -- Generation of the signed distance field from the point set is a common methodology for the surface reconstruction -- The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned nature of the distance -- We propose an extension to the marching cubes algorithm allowing the reconstruction of 0-level iso-surfaces in an unsigned distance field -- We calculate more information inside each cell of the marching cubes lattice and then we extract the intersection points of the surface within the cell then we identify the marching cubes case for the triangulation -- Our algorithm generates good surfaces but the presence of ambiguities in the case selection generates some topological mistakesÍtem Triangular mesh parameterization with trimmed surfaces(Springer Verlag, 2015) Ruíz, Óscar E.; Mejía, Daniel; Cadavid, Carlos A.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEGiven a 2manifold triangular mesh \(M \subset {\mathbb {R}}^3\), with border, a parameterization of \(M\) is a FACE or trimmed surface \(F=\{S,L_0,\ldots, L_m\}\) -- \(F\) is a connected subset or region of a parametric surface \(S\), bounded by a set of LOOPs \(L_0,\ldots ,L_m\) such that each \(L_i \subset S\) is a closed 1manifold having no intersection with the other \(L_j\) LOOPs -- The parametric surface \(S\) is a statistical fit of the mesh \(M\) -- \(L_0\) is the outermost LOOP bounding \(F\) and \(L_i\) is the LOOP of the ith hole in \(F\) (if any) -- The problem of parameterizing triangular meshes is relevant for reverse engineering, tool path planning, feature detection, redesign, etc -- Stateofart mesh procedures parameterize a rectangular mesh \(M\) -- To improve such procedures, we report here the implementation of an algorithm which parameterizes meshes \(M\) presenting holes and concavities -- We synthesize a parametric surface \(S \subset {\mathbb {R}}^3\) which approximates a superset of the mesh \(M\) -- Then, we compute a set of LOOPs trimming \(S\), and therefore completing the FACE \(F=\ {S,L_0,\ldots ,L_m\}\) -- Our algorithm gives satisfactory results for \(M\) having low Gaussian curvature (i.e., \(M\) being quasi-developable or developable) -- This assumption is a reasonable one, since \(M\) is the product of manifold segmentation preprocessing -- Our algorithm computes: (1) a manifold learning mapping \(\phi : M \rightarrow U \subset {\mathbb {R}}^2\), (2) an inverse mapping \(S: W \subset {\mathbb {R}}^2 \rightarrow {\mathbb {R}}^3\), with \ (W\) being a rectangular grid containing and surpassing \(U\) -- To compute \(\phi\) we test IsoMap, Laplacian Eigenmaps and Hessian local linear embedding (best results with HLLE) -- For the back mapping (NURBS) \(S\) the crucial step is to find a control polyhedron \(P\), which is an extrapolation of \(M\) -- We calculate \(P\) by extrapolating radial basis functions that interpolate points inside \(\phi (M)\) -- We successfully test our implementation with several datasets presenting concavities, holes, and are extremely nondevelopable -- Ongoing work is being devoted to manifold segmentation which facilitates mesh parameterization