Surface reconstruction from unorganized points

Surface reconstruction from unorganized points
复制标题

DOI:
10.1145/133994.134011
复制
发表时间:
1992-07
期刊:
Proceedings of the 19th annual conference on Computer graphics and interactive techniques
影响因子:
--
通讯作者:
Hugues Hoppe;T. DeRose;T. Duchamp;J. McDonald;W. Stuetzle
Hugues Hoppe;T. DeRose;T. Duchamp;J. McDonald;W. Stuetzle
中科院分区:
其他
文献类型:
--
作者:
Hugues Hoppe;T. DeRose;T. Duchamp;J. McDonald;W. Stuetzle

文献摘要

被引文献

相似文献

我们描述并演示了一种算法,该算法将一组无组织的点{xl,. . . . xn} ∈ R3,并产生一个逼近M的单纯曲面作为输出。无论是拓扑结构,边界的存在,还是M的几何形状都不被假设为预先已知-所有这些都是从数据中自动推断出来的。这个问题自然会出现在各种实际情况中,例如从多个视点对物体进行范围扫描、从二维切片恢复生物形状以及交互式表面草图绘制。
We describe and demonstrate an algorithm that takes as input an unorganized set of points {xl, . . . . xn} ⊂ R3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance - all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive surface sketching.