AN ALGORITHM FOR POINT CLUSTERING AND GRID GENERATION

被引:196
作者
BERGER, M
RIGOUTSOS, I
机构
[1] Courant Institute of Mathematical Sciences, New York, NY, 10012
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS | 1991年 / 21卷 / 05期
基金
美国国家科学基金会;
关键词
D O I
10.1109/21.120081
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The paper describes a special purpose point clustering algorithm, and its application to automatic grid generation, a technique used to solve partial differential equations. Extensions of techniques common in computer vision and pattern recognition literature are used to partition points into a set of enclosing rectangles. Examples from two-dimensional (2-D) calculations are shown, but the algorithm generalizes readily to three dimensions.
引用
收藏
页码:1278 / 1286
页数:9
相关论文
共 13 条
[1]  
ANDERBERG MR, 1973, CLUSTER ANAL APPLICA
[2]  
[Anonymous], 1988, ALGORITHMS CLUSTERIN
[3]  
Ballard DH, 1982, COMPUTER VISION
[4]  
BERGER M, 1986, SIAM J SCI STAT COMP, V7
[5]  
BERGER M, 1989, J COMP PHYS, V82
[6]  
CAMPBELL FWC, 1968, J PHYS, V197
[7]  
Duda R. O., 1973, PATTERN CLASSIFICATI, V3
[8]  
Hartigan JohnA., 1975, CLUSTERING ALGORITHM
[9]  
Horn B., 1986, ROBOT VISION, DOI DOI 10.1137/1030032
[10]  
KISE K, 1988, P INT C PATTERN RECO