Show simple item record

dc.contributor.authorFloriani, L.Deen_US
dc.contributor.authorFalcidieno, B.en_US
dc.contributor.authorC.Pienovi,en_US
dc.contributor.editorP.J.W. ten Hagenen_US
dc.date.accessioned2015-09-29T08:29:02Z
dc.date.available2015-09-29T08:29:02Z
dc.date.issued1983en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttp://dx.doi.org/10.2312/eg.19831026en_US
dc.description.abstractThis paper describes a method for constructing a surface representation model from a given set of data points.A Triangulated Irregular. Network has been chosen as data structure, thus representing the surface as a set of contiguous non -overlapping and irregurarly shaped triangular facets.The proposed method makes use of a Delaunay triangular grid adapted to non-convex domains. Using only representative subsets of the given set of points, the method allows the construction of approximating surfaces which rest within a predefined tolerance.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleA Delaunay-Based Method for Surface Approximationen_US
dc.description.seriesinformationEurographics Conference Proceedingsen_US
dc.identifier.doi10.2312/eg.19831026en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record