论文信息 - Incremental Algorithms Based on Discrete Green Theorem

Incremental Algorithms Based on Discrete Green Theorem

By using the discrete version of Green’s theorem and bivariate difference calculus we provide incremental algorithms to compute various statistics about polyominoes given, as input, by 4-letter words describing their contour. These statistics include area, coordinates of the center of gravity, moment of inertia, higher order moments, size of projections, hook lengths, number of pixels in common with a given set of pixels and also q-statistics.

Gilbert Labelle | Srecko Brlek | Annie Lacasse

[1] Wilfried Philips,et al. A new fast algorithm for moment computation , 1993, Pattern Recognit..

[2] Herbert Freeman,et al. On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[3] S. Golomb. Polyominoes: Puzzles, Patterns, Problems, and Packings , 1994 .

[4] Bernard Vauquelin,et al. Enumeration of parallelogram polyominoes with given bond and site perimeter , 1987, Graphs Comb..

[5] Alberto Del Lungo. Polyominoes Defined by Two Vectors , 1994, Theor. Comput. Sci..

[6] Gregory Y. Tang,et al. Region filling with the use of the discrete green theorem , 1988, Comput. Vis. Graph. Image Process..

[7] Fritz Albregtsen,et al. Fast and exact computation of Cartesian geometric moments using discrete Green's theorem , 1996, Pattern Recognit..

[8] Fritz Albregtsen,et al. Fast computation of invariant geometric moments: a new method giving correct results , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[9] Maurice Nivat,et al. Reconstructing Convex Polyominoes from Horizontal and Vertical Projections , 1996, Theor. Comput. Sci..

[10] Mireille Bousquet-Mélou,et al. New enumerative results on two-dimensional directed animals , 1998, Discret. Math..