DIRECT CONSTRUCTION OF POLYNOMIAL SURFACES FROM DENSE RANGE IMAGES THROUGH REGION GROWING

被引：62

作者：

SAPIDIS, NS

BESL, PJ

机构：

[1] Ship-Design Laboratory, Department of Naval Architecture and Marine Engineering, National Technical University of Athens, Zogafou

[2] Analytic Process Department, General Motors Research Laboratories, Warren

来源：

ACM TRANSACTIONS ON GRAPHICS | 1995年 / 14卷 / 02期

关键词：

ALGORITHMS; EXPERIMENTATION; THEORY; AESTHETIC SURFACE DESIGN; CLAY MODELS; COMPUTER-AIDED DESIGN; COMPUTER VISION; DENSE RANGE IMAGES; LEAST-SQUARES SURFACE FITTING; POINT SURFACE DISTANCE; RANGE IMAGE SEGMENTATION; SURFACE CONSTRUCTION; SURFACE RECONSTRUCTION; SURFACE COHERENCE;

D O I：

10.1145/221659.221672

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Existing techniques for approximating discrete data with smooth surfaces are based on either curve fitting or edge detection. Furthermore, they often rely on the user's expertise for determining the number of polynomial segments included in each surface. This paper describes a technique for approximating 3-D points with a functional surface z = z(x, y) based on the concept of ''region growing,'' aimed at maximizing the amount of data represented by a single polynomial segment. The resulting methodology requires minimal user interaction and makes full use of the ''surface information'' existing in a very dense set of digitized points produced by today's highly accurate range imaging sensors. Experimental results are presented showing the algorithm's performance on a variety of data.

引用

页码：171 / 200

页数：30