Abstract
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. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Brlek, S., Labelle, G., & Lacasse, A. (2003). Incremental algorithms based on discrete green theorem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2886, 277–287. https://doi.org/10.1007/978-3-540-39966-7_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
