Convex Aggregation Problems in $$\mathbb {Z}^2$$
From MaRDI portal
Publication:5237088
DOI10.1007/978-3-030-14085-4_34zbMath1451.68301OpenAlexW2915851344MaRDI QIDQ5237088
Publication date: 16 October 2019
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_34
Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Reconstructing convex polyominoes from horizontal and vertical projections
- Reconstruction of convex lattice sets from tomographic projections in quartic time
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- First steps in the algorithmic reconstruction of digital convex sets
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
This page was built for publication: Convex Aggregation Problems in $$\mathbb {Z}^2$$
