The discrete Green theorem and some applications in discrete geometry
From MaRDI portal
Publication:2581344
DOI10.1016/J.TCS.2005.08.019zbMATH Open1081.68112OpenAlexW2124356944MaRDI QIDQ2581344FDOQ2581344
Authors: Gilbert Labelle, Srečko Brlek, Annie Lacasse
Publication date: 10 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.08.019
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reconstructing convex polyominoes from horizontal and vertical projections
- Polyominoes defined by two vectors
- New enumerative results on two-dimensional directed animals
- Salient and Reentrant Points of Discrete Sets
- Incremental algorithms based on discrete Green theorem.
- Enumeriation of parallelogram polyominoes with given bond and site perimeter
- Title not available (Why is that?)
Cited In (6)
- Discrete sets with minimal moment of inertia
- Exterior diffraction problems for two-dimensional square lattice
- Incremental algorithms based on discrete Green theorem.
- Algorithms for polyominoes based on the discrete Green theorem
- Discrete versions of Stokes' theorem based on families of weights on hypercubes
- On Minimal Moment of Inertia Polyominoes
This page was built for publication: The discrete Green theorem and some applications in discrete geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581344)