Triangular covers of a digital object
From MaRDI portal
Publication:1786980
DOI10.1007/S12190-017-1162-8zbMATH Open1447.52028OpenAlexW2776045418MaRDI QIDQ1786980FDOQ1786980
Authors: Arindam Biswas, Partha Bhowmick, Barnali Das, Mousumi Dutt, Apurba Sarkar, Bhargab B. Bhattacharya 
Publication date: 25 September 2018
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-017-1162-8
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- The String-to-String Correction Problem
- Tiling with polyominoes and combinatorial group theory
- Tilings of convex polygons with congruent triangles
- Tiling polygons with lattice triangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cellular topology on the triangular grid
- Taxicab Geometry-A New Slant
- A combinatorial technique for construction of triangular covers of digital objects
- Tilings with trichromatic colored-edges triangles
- Regular production systems and triangle tilings
- Group theory and tiling problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Connections and minimizing geodesics of taxicab geometry
- Trigonometry on iso-taxicab geometry
- Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary
- Algorithm for Generating a Digital Straight Line on a Triangular Grid
- On the iso-taxicab trigonometry
Cited In (10)
- Construction of sandwich cover of digital objects
- Rotations on the triangular grid: angles of changes of the neighborhood motion map
- A combinatorial technique for construction of triangular covers of digital objects
- Largest area parallelogram inside a digital object in a triangular grid
- Construction of 3D orthogonal cover of a digital object
- A combinatorial algorithm to construct 3D isothetic covers
- Finding shortest triangular path and its family inside a digital object
- Exact and optimal conversion of a hole-free 2\textsc{d} digital object into a union of balls in polynomial time
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- You can (sometimes) tell an image by its cover
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)
