Geodesic-based manifold learning for parameterization of triangular meshes
dc.citation.epage | 14 | spa |
dc.citation.journalAbbreviatedTitle | IJIDeM | spa |
dc.citation.journalTitle | International Journal on Interactive Design and Manufacturing (IJIDeM) | eng |
dc.citation.journalTitle | International Journal on Interactive Design and Manufacturing | spa |
dc.citation.spage | 1 | spa |
dc.contributor.author | Acosta, Diego A. | |
dc.contributor.author | Ruíz, Óscar E. | |
dc.contributor.author | Arroyave, Santiago | |
dc.contributor.author | Ebratt, Roberto | |
dc.contributor.author | Cadavid, Carlos | |
dc.contributor.author | Londono, Juan J. | |
dc.contributor.department | Universidad EAFIT. Departamento de Ingeniería Mecánica | spa |
dc.contributor.researchgroup | Laboratorio CAD/CAM/CAE | spa |
dc.date.accessioned | 2016-11-18T21:56:35Z | |
dc.date.available | 2016-11-18T21:56:35Z | |
dc.date.issued | 2014 | |
dc.description.abstract | Reverse 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 | eng |
dc.format | application/pdf | eng |
dc.identifier.doi | 10.1007/s12008-014-0249-9 | |
dc.identifier.issn | 1955-2505 | |
dc.identifier.uri | http://hdl.handle.net/10784/9668 | |
dc.language.iso | eng | eng |
dc.publisher | Springer Verlag | spa |
dc.relation.ispartof | International Journal on Interactive Design and Manufacturing (IJIDeM), pp 1-14 | spa |
dc.relation.uri | http://link.springer.com/article/10.1007/s12008-014-0249-9 | |
dc.rights | info:eu-repo/semantics/closedAccess | |
dc.rights.local | Acceso abierto | spa |
dc.subject.keyword | Triangulation | spa |
dc.subject.keyword | Polyhedra | spa |
dc.subject.keyword | Algorithms | spa |
dc.subject.keyword | Minimal surfaces | spa |
dc.subject.keyword | Topology | spa |
dc.subject.keyword | Graph theory | spa |
dc.subject.keyword | Geodesy | spa |
dc.subject.keyword | Numerical grid generation (Numerical analysis) | spa |
dc.subject.keyword | Triangulation | eng |
dc.subject.keyword | Polyhedra | eng |
dc.subject.keyword | Algorithms | eng |
dc.subject.keyword | Minimal surfaces | eng |
dc.subject.keyword | Topology | eng |
dc.subject.keyword | Graph theory | eng |
dc.subject.keyword | Geodesy | eng |
dc.subject.keyword | Numerical grid generation (Numerical analysis) | eng |
dc.subject.keyword | Ingeniería inversa | .keywor |
dc.subject.keyword | Superficies NURBS | .keywor |
dc.subject.keyword | Geometría computacional | .keywor |
dc.subject.keyword | Reconstrucción superficial | .keywor |
dc.subject.keyword | Triangulación de Delaunay | .keywor |
dc.subject.lemb | TRIANGULACIÓN | spa |
dc.subject.lemb | POLIEDRO | spa |
dc.subject.lemb | ALGORITMOS | spa |
dc.subject.lemb | SUPERFICIES MÍNIMAS | spa |
dc.subject.lemb | TOPOLOGÍA | spa |
dc.subject.lemb | TEORÍA DE GRAFOS | spa |
dc.subject.lemb | GEODESIA | spa |
dc.subject.lemb | GENERACIÓN NUMÉRICA DE MALLAS (ANÁLISIS NUMÉRICO) | spa |
dc.title | Geodesic-based manifold learning for parameterization of triangular meshes | eng |
dc.type | info:eu-repo/semantics/article | eng |
dc.type | article | eng |
dc.type | info:eu-repo/semantics/publishedVersion | eng |
dc.type | publishedVersion | eng |
dc.type.local | Artículo | spa |
Archivos
Bloque original
1 - 3 de 3
No hay miniatura disponible
- Nombre:
- Geodesic-based.html
- Tamaño:
- 275 B
- Formato:
- Hypertext Markup Language
- Descripción:
No hay miniatura disponible
- Nombre:
- Geodesic-based.pdf
- Tamaño:
- 625.93 KB
- Formato:
- Adobe Portable Document Format
- Descripción:
- Web Page Print
No hay miniatura disponible
- Nombre:
- s12008-014-0249-9.pdf
- Tamaño:
- 3.14 MB
- Formato:
- Adobe Portable Document Format
- Descripción:
Bloque de licencias
1 - 1 de 1
No hay miniatura disponible
- Nombre:
- license.txt
- Tamaño:
- 2.5 KB
- Formato:
- Item-specific license agreed upon to submission
- Descripción: