Sums, projections, and sections of lattice sets, and the discrete covariogram

Discrete and Computational Geometry

Volumn 34, Issue 3, 2005, Pages 391-409

  Gardner, Richard J ^a   Gronchi, Paolo ^b   Zong, Chuanming ^c  

^a WESTERN WASHINGTON UNIVERSITY   (United States)

^b CNR   (Italy)

^c PEKING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23944469960     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-005-1169-z     Document Type: Article

References (35)

1. I. Bárány and J. Matoušek, A fractional Helly theorem for convex lattice sets, Adv. Math. 174 (2003), 227-235.
2. U. Betke and K. Böröczky, Jr., Asymptotic formulae for the lattice point enumerator, Canad. J. Math. 51 (1999), 225-249.
3. G. Bianchi, Determining convex polygons from their covariograms, Adv. in Appl Prob. 34 (2002), 261-266.
4. G. Bianchi, Matheron's conjecture for the covariogram problem, J. London Math. Soc. (2) 71 (2005), 203-220.
5. 2 bodies, J. Differential Geom. 60 (2002), 177-198.
6. S. Brunetti and A. Daurat, An algorithm reconstructing lattice convex sets, Theoret. Comput. Sci. 304 (2003), 35-57.
7. A. Cabo and A. Baddeley, Estimation of mean particle volume using the set covariance function, Adv. in Appl. Probab. 35 (2003), 27-46.
8. A. Cabo and R. H. P. Janssen, Cross-variance functions characterise bounded closed regular sets, CWI Technical Report, Amsterdam, 1994.
9. V. I. Danilov and G. A. Koshevoy, Discrete convexity and unimodularity - I, Adv. Math. 189 (2004), 301-324.
10. 2, in: CNR'IUT2000, vol. 1, Presses Universitaires d'Orléans, Orléans, 2000, pp. 341-350.
11. A. Daurat, Y. Gérard, and M. Nivat, The chords' problem, Theoret. Comput. Sci. 282 (2002), 319-336.
12. I. Debled-Rennesson, J.-L. Rémy, and J. Rouyer-Degli, Detection of the discrete convexity of polyominoes, Discrete Appl. Math. 125 (2003), 115-133.
13. J.-P. Doignon, Convexity in crystollographical lattices, J. Geom. 3 (1973), 71-85.
14. R. J. Gardner, Geometric Tomography, Cambridge University Press, New York, 1995. Corrections and update available at http://www.ac.wwu.edu/~gardner.
15. R. J. Gardner and P. Gritzmann, Discrete tomography: determination of finite sets by X-rays, Trans. Amer. Math. Soc. 349 (1997), 2271-2295.
16. R. J. Gardner and P. Gritzmann, Uniqueness and complexity in discrete tomography, in: Discrete Tomography: Foundations, Algorithms and Application, ed. by G. T. Herman and A. Kuba, Birkhäuser, Boston, MA, 1999, pp. 85-113.
17. R. J. Gardner and P. Gronchi, A Brunn-Minkowski inequality for the integer lattice, Trans. Amer. Math. Soc. 353 (2001), 3995-4024.
18. R. J. Gardner and G. Zhang, Affine inequalities and radial mean bodies, Amer. J. Math. 120 (1998), 493-504.
19. J. P. Glusker, B. K. Patterson, and M. Rossi, Patterson and Pattersons, Oxford University Press, New York, 1987.
20. P. Gritzmann and J. M. Wills, Lattice points, in: Handbook of Convexity, ed. by P. M. Gruber and J. M. Wills, North-Holland, Amsterdam, 1993, pp. 765-797.
21. H. Hadwiger, Vorlesungen über Inhalt, Oberfläche und Isoperimetrie, Springer, Berlin, 1957.
22. A. Heppes, On the determination of probability distributions of more dimensions by their projections, Acta Math. Acad. Sci. Hung. 6 (1956), 403-410.
23. G. T. Herman and A. Kuba, Discrete Tomography: Foundations, Algorithms, and Applications, Birkhäuser, Boston, MA, 1999.
24. C. L. Mallows and J. M. C. Clark, Line-intercept distributions do not characterize plane sets, J. Appl. Probab. 7 (1970), 240-244.
25. G. Matheron, Random Sets and Integral Geometry, Wiley, New York, 1975.
26. M. Meyer, A volume inequality concerning sections of convex sets, Bull. London Math. Soc. 20 (1988), 151-155.
27. A. Rényi, On projections of probability distributions, Acta Math. Acad. Sci. Hung. 3 (1952), 131-142.
28. C. Ronse, A strong chord property for 4-connected convex digital sets, Comput. Vision Graphics Image Process. 35 (1986), 259-269.
29. J. Rosenblatt and P. D. Seymour, The structure of homometric sets, SIAM J. Algebraic Discrete Methods 3 (1982), 343-350.
30. M. Schmitt, On two inverse problems in mathematical morphology, in: Mathematical Morphology in Image Processing, ed. by E. R. Dougherty, Marcel Dekker, New York, pp. 151-169.
31. R. Schneider, Convex Bodies: The Brunn-Minkowski Theory, Cambridge University Press, Cambridge, 1993.
32. A. J. Schwenk, How to minimize the largest shadow of a finite set, in: Graphs and Applications, Boulder, CO, 1982, Wiley Interscience, New York, 1985, pp. 279-294.
33. A. J. Schwenk and J. I. Munro, How small can the mean shadow of a set be?, Amer. Math. Monthly 90 (1983), 325-329.
34. J. Serra, Image Analysis and Mathematical Morphology, Academic Press, London, 1982.
35. S.S. Skiena and G. Sundaram, A partial digest approach to restriction site mapping, Bull. Math. Biol. 56 (1994), 275-294.