Show simple item record

dc.contributor.authorMencl, Roberten_US
dc.date.accessioned2014-10-21T07:37:53Z
dc.date.available2014-10-21T07:37:53Z
dc.date.issued1995en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/j.1467-8659.1995.cgf143-0445.xen_US
dc.description.abstractA new approach to the reconstruction of a surface from an unorganized set of points in space is presented. The point set may for example be obtained with a laser scanner or a manual digitizing tool, and is the only source of information about the shape of the acquired object. The basic idea is to calculate the Euclidean minimum spanning tree (EMST) of the given points. The EMST is then augmented to the so-called surface description graph (SDG). Finally the wire frame defined by the SDG are filled with triangles. The advantage of our approach is that also highly non-convex and even disconnected surfaces are reconstructed quite reliably. This is demonstrated for a variety of data sets.en_US
dc.publisherBlackwell Science Ltd and the Eurographics Associationen_US
dc.titleA Graph-Based Approach to Surface Reconstructionen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume14en_US
dc.description.number3en_US
dc.identifier.doi10.1111/j.1467-8659.1995.cgf143-0445.xen_US
dc.identifier.pages445-456en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record