Random generation of \(Q\)-convex sets

DOI10.1016/j.tcs.2005.06.033zbMath1080.68081OpenAlexW2021345305MaRDI QIDQ2576884

Alain Daurat, Sara Brunetti

Publication date: 29 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.033

zbMATH Keywords

convexitysalient pointslattice setsuniform generator

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (6)

Smooth column convex polyominoes ⋮ A measure of \(Q\)-convexity for shape analysis ⋮ Discrete Q-Convex Sets Reconstruction from Discrete Point X-Rays ⋮ RECONSTRUCTION OF TWO SUBCLASSES OF 2L-CONVEX POLYOMINOES ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Stability in discrete tomography: some positive results

Cites Work

• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• An algorithm reconstructing convex lattice sets.
• Medians of discrete sets according to a linear distance
• Determination of Q-convex sets by X-rays
• The limit shape of convex lattice polygons
• Generating convex polyominoes at random
• A method for the enumeration of various classes of column-convex polygons
• An experimental study of the stability problem in discrete tomography
• A bibliography on digital and computational convexity (1961-1988)
• Computational Geometry in C
• On the number of digital convex polygons inscribed into an (m,m)-grid

This page was built for publication: Random generation of \(Q\)-convex sets