Abstract
The construction of a minimum-area geometric cover of a digital object is important in many fields of image analysis and computer vision. We propose here the first algorithm for constructing a minimum-area polygonal cover of a 2D digital object as perceived on a uniform triangular grid. The polygonal cover is triangular in the sense that its boundary consists of a sequence of edges on the underlying grid. The proposed algorithm is based on certain combinatorial properties of a digital object on a grid, and it computes the tightest cover in time linear in perimeter of the object. We present experimental results to demonstrate the efficacy, robustness, and versatility of the algorithm, and they indicate that the runtime varies inversely with the grid size.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beeson, M.: Triangle tiling I: The tile is similar to ABC or has a right angle. arXiv preprint arXiv:1206.2231 (2012)
Birch, C.P.D., Oom, S.P., Beecham, J.A.: Rectangular and hexagonal grids used for observation, experiment and simulation in ecology. Ecological Modelling 206(3), 347–359 (2007)
Biswas, A., Bhowmick, P., Bhattacharya, B.B.: Construction of isothetic covers of a digital object: A combinatorial approach. Journal of Visual Communication and Image Representation 21(4), 295–310 (2010)
Bodini, O., Rémila, E.: Tilings with trichromatic colored-edges triangles. Theoretical Computer Science 319(1), 59–70 (2004)
Butler, S., Chung, F., Graham, R., Laczkovich, M.: Tiling polygons with lattice triangles. Discrete & Computational Geometry 44(4), 896–903 (2010)
Clason, R.G.: Tiling with golden triangles and the penrose rhombs using logo. Journal of Computers in Mathematics and Science Teaching 9(2), 41–53 (1989)
Conway, J.H., Lagarias, J.C.: Tiling with polyominoes and combinatorial group theory. Journal of Combinatorial Theory, Series A 53(2), 183–208 (1990)
Daniel, H., Tom, K., Elmar, L.: Exploring simple triangular and hexagonal grid polygons online. arXiv preprint arXiv:1012.5253 (2010)
Freeman, H.: Algorithm for generating a digital straight line on a triangular grid. IEEE Transactions on Computers 100(2), 150–152 (1979)
Gardner, M.: Knotted Doughnuts and Other Mathematical Entertainments. Freeman and Company, New York (1986)
Goodman-Strauss, C.: Regular production systems and triangle tilings. Theoretical Computer Science 410(16), 1534–1549 (2009)
Innchyn, H.: Geometric transformations on the hexagonal grid. IEEE Transactions on Image Processing 4(9), 1213–1222 (1995)
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Laczkovich, M.: Tilings of convex polygons with congruent triangles. Discrete & Computational Geometry 48(2), 330–372 (2012)
Luczak, E., Rosenfeld, A.: Distance on a hexagonal grid. IEEE Transactions on Computers 25(5), 532–533 (1976)
Nagy, B.: Neighbourhood sequences in different grids. Ph.D. thesis, University of Debrecen (2003)
Nagy, B.: Shortest paths in triangular grids with neighbourhood sequences. Journal of Computing and Information Technology 11(2), 111–122 (2003)
Nagy, B.: Characterization of digital circles in triangular grid. Pattern Recognition Letters 25(11), 1231–1242 (2004)
Nagy, B.: Generalised triangular grids in digital geometry. Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 20(1), 63–78 (2004)
Nagy, B.: Distances with neighbourhood sequences in cubic and triangular grids. Pattern Recognition Letters 28(1), 99–109 (2007)
Nagy, B.: Cellular topology on the triangular grid. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 143–153. Springer, Heidelberg (2012)
Nagy, B., Barczi, K.: Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary. International Journal of Computer Mathematics 90(8), 1–24 (2012)
Shimizu, K.: Algorithm for generating a digital circle on a triangular grid. Computer Graphics and Image Processing 15(4), 401–402 (1981)
Subramanian, K.G., Wiederhold, P.: Generative models for pictures tiled by triangles. Science and Technology 15(3), 246–265 (2012)
Sury, B.: Group theory and tiling problems. Symmetry: A Multi-Disciplinary Perspective 16(16), 97–117 (2011)
Wüthrich, C.A., Stucki, P.: An algorithmic comparison between square-and hexagonal-based grids. CVGIP: Graphical Models and Image Processing 53(4), 324–339 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Das, B., Dutt, M., Biswas, A., Bhowmick, P., Bhattacharya, B.B. (2014). A Combinatorial Technique for Construction of Triangular Covers of Digital Objects. In: Barneva, R.P., Brimkov, V.E., Šlapal, J. (eds) Combinatorial Image Analysis. IWCIA 2014. Lecture Notes in Computer Science, vol 8466. Springer, Cham. https://doi.org/10.1007/978-3-319-07148-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-07148-0_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07147-3
Online ISBN: 978-3-319-07148-0
eBook Packages: Computer ScienceComputer Science (R0)