FILLING BY QUADRANTS OR OCTANTS

被引：14

作者：

ATKINSON, HH

GARGANTINI, I

WALSH, TRS

机构：

[1] Univ of Western Ontario, Dep of, Computer Science, London, Ont, Can, Univ of Western Ontario, Dep of Computer Science, London, Ont, Can

来源：

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING | 1986年 / 33卷 / 02期

关键词：

COMPUTER PROGRAMMING - Algorithms - IMAGE PROCESSING;

D O I：

10.1016/0734-189X(86)90112-X

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Filling by quadrants or by octants is shown to be executable in time proportional to the length of the border multipled by n, the logarithm of the diameter of the image. The underlying data structure is the linear quadtree in two dimensions or the linear octtree in three dimensions. The new features introduced by this paper are: (i) the low worst-case time complexity, as compared with previous algorithms, (ii) the fact that the basic space requirements consist of the input, output and 4n or 8n pointers, and (iii) its 3D implementation. The last capability has been developed for medical imaging purposes and 3D modeling.

引用

页码：138 / 155

页数：18

共 22 条

[1] DETERMINATION OF THE 3 D BORDER BY REPEATED ELIMINATION OF INTERNAL SURFACES [J].

ATKINSON, HH ;

GARGANTINI, I ;

RAMANATH, MVS .

COMPUTING, 1984, 32 (04) :279-295

[2] IMPROVEMENTS TO A RECENT 3D-BORDER ALGORITHM [J].

ATKINSON, HH ;

GARGANTINI, I ;

RAMANATH, MVS .

PATTERN RECOGNITION, 1985, 18 (3-4) :215-226

[3] COUNTING REGIONS, HOLES, AND THEIR NESTING LEVEL IN TIME PROPORTIONAL TO THE BORDER [J].

ATKINSON, HH ;

GARGANTINI, I ;

WALSH, TRS .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 29 (02) :196-215

[4]

BAASE S, 1978, COMPUTER ALGORITHMS, P76

[5]

BRASSEL KE, 1979, P ACM SIGGRAPH 79, P126

[6] LINEAR QUADTREES - A BLOCKING TECHNIQUE FOR CONTOUR FILLING [J].

GARGANTINI, I ;

ATKINSON, HH .

PATTERN RECOGNITION, 1984, 17 (03) :285-293

[7] LINEAR OCTTREES FOR FAST PROCESSING OF 3-DIMENSIONAL OBJECTS [J].

GARGANTINI, I .

COMPUTER GRAPHICS AND IMAGE PROCESSING, 1982, 20 (04) :365-374

[8] AN EFFECTIVE WAY TO REPRESENT QUADTREES [J].

GARGANTINI, I .

COMMUNICATIONS OF THE ACM, 1982, 25 (12) :905-910

[9] LINEAR QUADTREES FROM VECTOR REPRESENTATIONS OF POLYGONS [J].

MARK, DM ;

ABEL, DJ .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1985, 7 (03) :344-349

[10]

MEAGHER DJ, 1984, NCGA P COMPUT GRAPHI, P343

← 1 2 3 →