About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding minimal convex nested polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some theoretical challenges in digital geometry: a perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra: A lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Continuous Discretely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object discretizations in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital planarity -- a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear incremental algorithm for naive and standard digital lines and planes recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for digital line recognition in the general case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polytope covering and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary algorithm for digital arc segmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Representation of Straight Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum polygonal separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3282061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the min DSS problem of closed discrete curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Discrete Hyperspheres and Separatingness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Digital Polyhedra with a Fixed Number of Faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gift-wrapping based preimage computation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary digital plane recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Digital Level Layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal width of empty lattice simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3155868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polyhedral separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Straightness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projecting Lattice Polytopes Without Interior Lattice Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Digital Hyperplanes and Level Layers with Forbidden Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Digital Surfaces in Arbitrary Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties / rank
 
Normal rank

Revision as of 08:58, 14 July 2024

scientific article
Language Label Description Also known as
English
About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
scientific article

    Statements

    About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (English)
    0 references
    12 September 2017
    0 references
    polyhedral separability
    0 references
    lattice
    0 references
    convex and discrete geometry
    0 references
    polyhedron simplification
    0 references
    decidability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers