Recommendations
- A combinatorial technique for construction of triangular covers of digital objects
- Construction of 3D orthogonal cover of a digital object
- Construction of sandwich cover of digital objects
- A linear-time algorithm to compute the triangular hull of a digital object
- Finding Shortest Triangular Path in a Digital Object
Cites work
- scientific article; zbMATH DE number 2129318 (Why is no real title available?)
- scientific article; zbMATH DE number 3900666 (Why is no real title available?)
- scientific article; zbMATH DE number 4097299 (Why is no real title available?)
- scientific article; zbMATH DE number 1992654 (Why is no real title available?)
- scientific article; zbMATH DE number 2162255 (Why is no real title available?)
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- A combinatorial technique for construction of triangular covers of digital objects
- Algorithm for Generating a Digital Straight Line on a Triangular Grid
- Cellular topology on the triangular grid
- Connections and minimizing geodesics of taxicab geometry
- Group theory and tiling problems
- Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary
- On the iso-taxicab trigonometry
- Regular production systems and triangle tilings
- Taxicab Geometry-A New Slant
- The String-to-String Correction Problem
- Tiling polygons with lattice triangles
- Tiling with polyominoes and combinatorial group theory
- Tilings of convex polygons with congruent triangles
- Tilings with trichromatic colored-edges triangles
- Trigonometry on iso-taxicab geometry
Cited in
(10)- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- Rotations on the triangular grid: angles of changes of the neighborhood motion map
- Largest area parallelogram inside a digital object in a triangular grid
- A combinatorial algorithm to construct 3D isothetic covers
- You can (sometimes) tell an image by its cover
- A combinatorial technique for construction of triangular covers of digital objects
- Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time
- Finding shortest triangular path and its family inside a digital object
- Construction of sandwich cover of digital objects
- Construction of 3D orthogonal cover of a digital object
This page was built for publication: Triangular covers of a digital object
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786980)
