Incremental Algorithms Based on Discrete Green Theorem-Reference-Cited by-同舟云学术

Incremental Algorithms Based on Discrete Green Theorem

Published:2003 Issue: Volume: Page:277-287
ISSN:0302-9743
Container-title:Discrete Geometry for Computer Imagery
language:
Short-container-title:

Author:

Brlek Srečko,Labelle Gilbert,Lacasse Annie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-39966-7_26

Reference15 articles.

1. Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from their vertical and horizontal projections. Theoret. Comput. Sci. 155, 321–347 (1996)

2. Bousquet-Mélou, M.: New enumerative results on two-dimensional directed animals. Discrete Math 180(1-3), 73–106 (1998)

3. Brlek, S., Labelle, G., Lacasse, A.: Incremental Algorithms for Polyominoes Coded by their Contour, Research Report, Lacim, Un. Quebec à, Montréal (2003)

4. Clarke, A.L.: Isometrical polyominoes. J. Recreational Math. 13, 18–25 (1980)

5. Comtet, L.: Advanced Combinatorics. Reidel, Dordrechtz (1974)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Discrete Versions of Stokes’ Theorem Based on Families of Weights on Hypercubes;Discrete Geometry for Computer Imagery;2009

2. The discrete Green Theorem and some applications in discrete geometry;Theoretical Computer Science;2005-11

3. Algorithms for polyominoes based on the discrete Green theorem;Discrete Applied Mathematics;2005-04

4. A Note on a Result of Daurat and Nivat;Developments in Language Theory;2005

5. Combinatorial View of Digital Convexity;Discrete Geometry for Computer Imagery