Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 1278-1286 |
Number of pages | 9 |
Journal | IEEE Transactions on Systems, Man and Cybernetics |
Volume | 21 |
Issue number | 5 |
DOIs | |
State | Published - 1991 |
ASJC Scopus subject areas
- Engineering(all)