Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3

DOI10.1007/978-3-319-66272-5_23zbMath1433.68401OpenAlexW2745972781MaRDI QIDQ1690410

Yan Gerard

Publication date: 19 January 2018

Full work available at URL: https://hal.uca.fr/hal-02023886/file/DGCI2017.pdf

zbMATH Keywords

pattern recognitiongeometry of numbersdigital polyhedronhollow lattice polytopespolyhedral separation

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

A characterization of 2-threshold functions via pairs of prime segments ⋮ Efficiently testing digital convexity and recognizing digital convex polygons

This page was built for publication: Recognition of digital polyhedra with a fixed number of faces is decidable in dimension 3