Decomposition of rational discrete hyperplanes
From MaRDI portal
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Higher-dimensional and -codimensional surfaces in Euclidean and related (n)-spaces (53A07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites work
- Canonical representations of discrete curves
- Combinatorial generation of planar sets
- Combinatorics on Words
- Detection of the discrete convexity of polyominoes
- Digital planarity -- a review
- Discrete images, objects, and functions in \(Z^ n\)
- Faithful polygonal representation of the convex and concave parts of a digital curve
- Generation and recognition of digital planes using multi-dimensional continued fractions
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 48159 (Why is no real title available?)
- scientific article; zbMATH DE number 768067 (Why is no real title available?)
- scientific article; zbMATH DE number 1436417 (Why is no real title available?)
- scientific article; zbMATH DE number 5224144 (Why is no real title available?)
- MULTIDIMENSIONAL STURMIAN SEQUENCES AND GENERALIZED SUBSTITUTIONS
- On the min DSS problem of closed discrete curves
- On the topology of an arithmetic plane
- Parallelogram tilings and Jacobi-Perron algorithm
- The Generalized Gauss Reduction Algorithm
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Volumes of Projections of unit Cubes
This page was built for publication: Decomposition of rational discrete hyperplanes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985471)
