Show simple item record

dc.creatorAcosta, Diego A.
dc.creatorRuíz, Óscar E.
dc.creatorArroyave, Santiago
dc.creatorEbratt, Roberto
dc.creatorCadavid, Carlos
dc.creatorLondono, Juan J.
dc.date.available2016-11-18T21:56:35Z
dc.date.issued2014
dc.identifier.issn1955-2505spa
dc.identifier.urihttp://hdl.handle.net/10784/9668
dc.descriptionReverse 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 reductionspa
dc.formatapplication/pdfeng
dc.language.isoengspa
dc.publisherSpringer Verlagspa
dc.relation.ispartofInternational Journal on Interactive Design and Manufacturing (IJIDeM), pp 1-14spa
dc.relation.isversionofhttp://link.springer.com/article/10.1007/s12008-014-0249-9spa
dc.rightsinfo:eu-repo/semantics/closedAccesseng
dc.subjectIngeniería inversaspa
dc.subjectSuperficies NURBSspa
dc.subjectGeometría computacionalspa
dc.subjectReconstrucción superficialspa
dc.subjectTriangulación de Delaunayspa
dc.titleGeodesic-based manifold learning for parameterization of triangular meshesspa
dc.typearticleeng
dc.typeinfo:eu-repo/semantics/articleeng
dc.rights.accessRightsclosedAccessspa
dc.subject.lembTRIANGULACIÓNspa
dc.subject.lembPOLIEDROspa
dc.subject.lembALGORITMOSspa
dc.subject.lembSUPERFICIES MÍNIMASspa
dc.subject.lembTOPOLOGÍAspa
dc.subject.lembTEORÍA DE GRAFOSspa
dc.subject.lembGEODESIAspa
dc.subject.lembGENERACIÓN NUMÉRICA DE MALLAS (ANÁLISIS NUMÉRICO)spa
dc.type.spaArtículospa
dc.subject.keywordTriangulationspa
dc.subject.keywordPolyhedraspa
dc.subject.keywordAlgorithmsspa
dc.subject.keywordMinimal surfacesspa
dc.subject.keywordTopologyspa
dc.subject.keywordGraph theoryspa
dc.subject.keywordGeodesyspa
dc.subject.keywordNumerical grid generation (Numerical analysis)spa
dc.rights.accesoLibre accesospa
dc.date.accessioned2016-11-18T21:56:35Z
dc.type.hasVersionpublishedVersionspa
dc.tipo.versionObra publicadaspa
dc.citation.journalTitleInternational Journal on Interactive Design and Manufacturingspa
dc.citation.spage1spa
dc.citation.epage14spa
dc.citation.journalAbbreviatedTitleIJIDeMspa
dc.identifier.doi10.1007/s12008-014-0249-9spa


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record