Marching cubes in an unsigned distance field for surface reconstruction from unorganized point sets

dc.contributor.authorCongote, J.
dc.contributor.authorMoreno, A.
dc.contributor.authorBarandiaran, I.
dc.contributor.authorBarandiaran, J.
dc.contributor.authorPosada, J.
dc.contributor.authorRuiz, O.
dc.contributor.departmentUniversidad EAFIT. Departamento de Ingeniería Mecánicaspa
dc.contributor.researchgroupLaboratorio CAD/CAM/CAEspa
dc.date.accessioned2021-04-16T21:24:56Z
dc.date.available2021-04-16T21:24:56Z
dc.date.issued2010-01-01
dc.description.abstractSurface 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.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=2632
dc.identifier.isbn9789896740269
dc.identifier.otherWOS;000392907500024
dc.identifier.otherSCOPUS;2-s2.0-77956325310
dc.identifier.urihttp://hdl.handle.net/10784/29499
dc.language.isoengspa
dc.publisherINSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL & COMMUNICATION
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-77956325310&partnerID=40&md5=3d068bbde94ab37680bbb708514e7e4b
dc.rightsINSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL & COMMUNICATION
dc.sourceMarching Cubes In An Unsigned Distance Field For Surface Reconstruction From Unorganized Point Sets
dc.subject.keywordCase selectionseng
dc.subject.keywordCommon problemseng
dc.subject.keywordDistance fieldeng
dc.subject.keywordImplicit surfaceseng
dc.subject.keywordIntersection pointseng
dc.subject.keywordIso surfaceeng
dc.subject.keywordMarching cubeeng
dc.subject.keywordMarching Cubes algorithmeng
dc.subject.keywordPoint seteng
dc.subject.keywordSigned distance fieldseng
dc.subject.keywordUnorganized pointseng
dc.subject.keywordAlgorithmseng
dc.subject.keywordBioinformaticseng
dc.subject.keywordComputer graphicseng
dc.subject.keywordGeometryeng
dc.subject.keywordRepaireng
dc.subject.keywordSurface reconstructioneng
dc.titleMarching cubes in an unsigned distance field for surface reconstruction from unorganized point setseng
dc.typeinfo:eu-repo/semantics/conferencePapereng
dc.typeconferencePapereng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localDocumento de conferenciaspa

Archivos