Show simple item record

dc.contributor.authorGobeawan, Likeen_US
dc.contributor.authorXu, Shuhongen_US
dc.contributor.authorTurner, Stephen Johnen_US
dc.contributor.editorIk Soo Lim and David Duceen_US
dc.date.accessioned2014-01-31T19:58:12Z
dc.date.available2014-01-31T19:58:12Z
dc.date.issued2007en_US
dc.identifier.isbn978-3-905673-63-0en_US
dc.identifier.urihttp://dx.doi.org/10.2312/LocalChapterEvents/TPCG/TPCG07/165-172en_US
dc.description.abstractStitching two mesh partitions at their boundaries poses some challenges, especially when a visually seamless result is desired. In general, direct stitching of mismatching mesh boundaries does not readily produce a seamless result, unless some geometric measures are considered in the process. In this paper, a novel stitching technique for mesh partitions with mismatching boundaries is proposed. Using the boundary information of the mesh partitions, smooth curves are constructed across the partition boundaries and new vertices along the stitch path are generated to replace the mismatching boundary vertices. Several seamlessness criteria are considered in the construction of the algorithm to ensure a seamless stitch result.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling I.3.m [Computer Graphics]: Miscellaneousen_US
dc.titleSeamless Mesh Stitching Using Curve Approximationen_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record