DOCSLIB.ORG

Quasi-Regular Tessellation of Hexagons

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quasi-Regular Tessellation of Hexagons Journal of Computing and Information Technology - CIT 9, 2001, 3, 227–232 227 Quasi-regular Tessellation of Hexagons Branko Kauciˇ cˇ1 and Borut Zalikˇ 2 1 PEF, University of Maribor, Slovenia 2 FERI, University of Maribor, Slovenia An algorithm for quasi-regular hexagon tessellation of discussed. In the last, fifth section, the paper is uniformly distributed points is presented. At first, the summarised. needed definitions and notations are introduced. Then, the algorithm for the tessellation, based on “laying-down the sticks” analogy, is given. At the end, the estimation of the algorithm time complexity is done. 2. Tessellation Keywords: tessellation, gridded spatial data, computa- tional geometry In general, the tessellation is divided into the following groups: a regular tessellation, where the sides of tiles are all of the same length. Only three 1. Introduction possible shapes of tiles exist: triangles, squa- res, and hexagons, where triangular and squa- A tessellation is a process that surrounds us ev- red tiles are usually used in practice. ery day. It is an old problem in mathematics and a quasi-regular tessellation, where all tiles in computational geometry Preparata, 1985 . are of the same shape, but the lengths of the Several tessellations are known, although only sides are not equal. some of them are interesting in the computa- a semi-regular tessellation, where several tional geometry. The main aim of the tessella- regular shapes are combined together. tion is to tile or divide the space of the inter- est into smaller parts tiles upon which other a non-regular tessellation, where the tiles problems could be solved more easily e.g. ge- have different lengths of their sides, and are ometric search, visualising only parts of the in- differently shaped. The best known tessella- terest. tion in practice are Voronoi diagrams Mul- muley, 1994; Preparata, 1985, although In the paper, a new algorithm for the tessella- in theory different ideas exist Armstrong, tion of hexagons is presented. We believe that 1988; Farmer, 1996; Wells, 1991. tessellation of hexagons is more efficient than other tessellations for some applications on dig- Tessellations of squares are simple, because there is no need to apply any rotation to com- ital elevation models DEMs , as for example a fly-through problem. We will restrict ourselves pletely cover the plane. On the other side, tes- to quasi-regular tessellation only. sellations of triangles produce gaps if they are not rotated. The same is true for hexagons. The paper is divided into five sections. At the beginning, a tessellation of hexagons is ex- plained. The algorithm of the tessellation is 2.1. Tessellation of Hexagons given in the next section, together with the de- tails of the input data. In the fourth section, the As stated before, the paper considers a quasi- idea of obtaining optimal tessellation and the regular tessellation of hexagons. The tessella- worst case time complexity of the algorithm is tion of hexagons has some advantages against 228 Quasi-regular Tessellation of Hexagons Fig. 1. Examples of tessellations. other two regular tessellations Kauciˇ c,ˇ 2001a . lation of the rectangular area with one of many Each vertex of the tile has the smallest number optimal solutions b . An optimal solution po- of neighbouring tiles, each tile has the smallest sition of the starting point can be computed in number of neighbouring tiles, the neighbour- a constant time. On the right side c , more hood of the tile is determined only with edges complex example with a hole is given. An op- of the tile and not with the combination of ver- timal solution cannot be found so simply as in tices and edges, and the number of tiles in the previous example. tessellation is the smallest under certain condi- tions. So far, nothing was said about the representa- tion of an area. In the continuation, only points Further, at the tessellation of hexagons, the fol- arranged in the regular grid are considered. It lowing interesting questions occur: With the turned out that the regular tessellation does not given size of a hexagon, how an arbitrary area give the optimal results in some applications can be tessellated? What is the minimum num- e.g. fly-through problem . More suitable are ber of tiles? How must the area be tessellated quasi-regular hexagons, where some points of to reach the minimum? How many tiles are en- the regular grid lie on the border of the tile tirely in the area, and how many of them cover Fig. 2 a . the area only partially? With a given point in the tessellated area, which cell contains it? In Points located on edges, splitting two neigh- general, answers to these questions especially bouring tiles, are doubled in both tiles. In this to the second and third present a hard problem. manner, the direct connections between bor- To illustrate the difficulty of given questions and der points of neighbouring tiles exist Kauciˇ c,ˇ the need for optimal tessellation, Fig. 1 shows 2001a. Fig. 2 b shows how the dimension of two examples of tessellations of an arbitrary the quasi-regular hexagon tile is defined. The area. values a and b can take any positive integer num- ber, where a represents the number of points The left side of the figure a shows the tessel- in upright side, and b is the number of points on the slanted side. However, to get the best approximation of the regular tessellation, b is a p determined by equation b ROUND . 2 3. Algorithm of the Tessellation The motivation for the presented tessellation al- gorithm was a database of terrain elevations. Regular grids are usually in the form of a rect- angle, while in our case the border of the regular Fig. 2. a quasi-regular hexagons, b the hexagon tile. grid represents the border of the land, which is Quasi-regular Tessellation of Hexagons 229 AL of arrays” s of data. At the second level, AL contains all points of the corresponding col- umn. Each element of AL represents a connected set of points and consists of a starting point, an ending point, and elevations. The starting point represents a vertical index of the first point in the connected set of points, and the ending point represents a vertical index of the last point in the same set of points. The most upper points in the area have their vertical index set to 0, and empty columns that represent a region without points have NULL pointers in ML. The algorithm for the tessellation of hexagons works with a sweep traversal over a tessellated area and in each step behaves as if the sticks were being laid-down. Each sweep step is asso- ciated with a column in the input data structure. For each column, the algorithm lays-down the sticks of appropriate length under each other until the end of points in the current column is Fig. 3. a Input data structure. reached. Let us observe Fig. 3 b . Suppose, there are enough points in the first column to lay-down far from being a rectangle. The data was then at least two consecutive tiles. The first starting converted into a more appropriate form. Data point in the first AL marked with an arrow is structure consisting of a list of lists as shown on taken as the starting point of the tessellation. Fig. 3 a is used. The upper stick used is shorter than the lower ML Ss The “main list” stores pointers to the “lists stick we name them “short stick” and Fig. 3. b Division of cells on short and large. 230 Quasi-regular Tessellation of Hexagons Ls “large stick” . Accordingly to that, are the TS hexagons in the same row of type short ,or TL type large . An additional array Fig. 3 b is used to control the tessellation process, named CCL “control cell list” . It contains identifiers of tiles and the information about the row type TS TL TS or . All even entries are of type and the odd entries are of type TN. Ls At each step of the algorithm, Ss and have to be updated. The update depends on the state of the tessellation process. Four states are possible Fig. 4 : CCL left side, where all entries in , repre- senting the cells of TS are removed. Some of them are replaced with new identifiers in the next step. Ss slanted-up, where the length of in- creases by 2, and the length of Ls decreases by the same value. In this state, the tessella- Fig. 4. Four states of the tessellation process. tion process stays at most b 1 times, except if the end of ML is reached. peak is similar to the first state, but this time Within those states, an additional value status is it is applied on the cells of TL. updated. As shown in Fig. 4, it starts with value slanted-down, where the opposite actions of 0 and increases by 1 in state “slanted-up”, while the state “slanted-up” are performed. in the state “slanted-down” it decreases by 1. LDS ALGORITHM: TS laydown current stick within Ss input : a, b, ML f COMPUTEnext stick //initialization if CONTAINSCCLindex 1 then CCL Ss Ls UPDATECCLnew identifier COMPUTEzero status of ML while not end endif similar to TS //slanted-up LS end of ML COMPUTE while status b 1 and not type index COMPUTEindex boundary type endwhile COMPUTESs Ls if start boundary then status if CONTAINSCCLindex 1 then endwhile identifier UPDATECCLnew //peak of ML endif if not end then of TL endif REMOVECCLcells if CONTAINSCCLindex then endif identifier UPDATECCLnew //slanted-down to slantedup endif similar //laying-down the sticks //left side COMPUTEfirst stick similar to peak not reached while bottom endwhile case type of g Fig.
Load more

Recommended publications
  • ICES REPORT 14-22 Characterization, Enumeration and Construction Of
    ICES REPORT 14-22 August 2014 Characterization, Enumeration and Construction of Almost-regular Polyhedra by Muhibur Rasheed and Chandrajit Bajaj The Institute for Computational Engineering and Sciences The University of Texas at Austin Austin, Texas 78712 Reference: Muhibur Rasheed and Chandrajit Bajaj, "Characterization, Enumeration and Construction of Almost-regular Polyhedra," ICES REPORT 14-22, The Institute for Computational Engineering and Sciences, The University of Texas at Austin, August 2014. Characterization, Enumeration and Construction of Almost-regular Polyhedra Muhibur Rasheed and Chandrajit Bajaj Center for Computational Visualization Institute of Computational Engineering and Sciences The University of Texas at Austin Austin, Texas, USA Abstract The symmetries and properties of the 5 known regular polyhedra are well studied. These polyhedra have the highest order of 3D symmetries, making them exceptionally attractive tem- plates for (self)-assembly using minimal types of building blocks, from nanocages and virus capsids to large scale constructions like glass domes. However, the 5 polyhedra only represent a small number of possible spherical layouts which can serve as templates for symmetric assembly. In this paper, we formalize the notion of symmetric assembly, specifically for the case when only one type of building block is used, and characterize the properties of the corresponding layouts. We show that such layouts can be generated by extending the 5 regular polyhedra in a sym- metry preserving way. The resulting family remains isotoxal and isohedral, but not isogonal; hence creating a new class outside of the well-studied regular, semi-regular and quasi-regular classes and their duals Catalan solids and Johnson solids. We also show that this new family, dubbed almost-regular polyhedra, can be parameterized using only two variables and constructed efficiently.
    [Show full text]
  • Omputational Design and Fabrication with Auxetic Materials
    Beyond Developable: Computational Design and Fabrication with Auxetic Materials Mina Konakovic´ Keenan Crane Bailin Deng Sofien Bouaziz Daniel Piker Mark Pauly EPFL CMU University of Hull EPFL EPFL Figure 1: Introducing a regular pattern of slits turns inextensible, but flexible sheet material into an auxetic material that can locally expand in an approximately uniform way. This modified deformation behavior allows the material to assume complex double-curved shapes. The shoe model has been fabricated from a single piece of metallic material using a new interactive rationalization method based on conformal geometry and global, non-linear optimization. Thanks to our global approach, the 2D layout of the material can be computed such that no discontinuities occur at the seam. The center zoom shows the region of the seam, where one row of triangles is doubled to allow for easy gluing along the boundaries. The base is 3D printed. Abstract 1 Introduction We present a computational method for interactive 3D design and Recent advances in material science and digital fabrication provide rationalization of surfaces via auxetic materials, i.e., flat flexible promising opportunities for industrial and product design, engi- material that can stretch uniformly up to a certain extent. A key neering, architecture, art and science [Caneparo 2014; Gibson et al. motivation for studying such material is that one can approximate 2015]. To bring these innovations to fruition, effective computational doubly-curved surfaces (such as the sphere) using only flat pieces, tools are needed that link creative design exploration to material making it attractive for fabrication. We physically realize surfaces realization. A versatile approach is to abstract material and fabrica- by introducing cuts into approximately inextensible material such tion constraints into suitable geometric representations which are as sheet metal, plastic, or leather.
    [Show full text]
  • Generating Apparently-Random Colour Patterns
    Computational Aesthetics in Graphics, Visualization, and Imaging (2012) D. Cunningham and D. House (Editors) Random Discrete Colour Sampling Henrik Lieng Christian Richardt Neil A. Dodgson Generating apparently-randomUniversity of Cambridge colour patterns Used with permission of the authors Figure 1: We present an algorithm that distributes colours randomly using a human-centric definition of randomness. Left: Colours distributed using Matlab’s random-number generator. Middle: Result of our algorithm. Notice that our algorithm does not produce any distinctive patterns. Right: An image similar to one of Damien Hirst’s spot paintings. Abstract Apparently-random distributions of colours in a discrete setting have been used by many artists and craftsmen in the past century. Manual colourisation is a tedious and difficult process. Automatic colourisation, on the other hand, tends not to not look ‘random’ to a human, as randomly-generated clusters and patterns stimulate human perception and break the appearance of randomness. We propose an algorithm that minimises these apparent patterns, making the distribution of colours look as if they have been distributed randomly by a human. We show that our approach is superior to current solutions, especially for small numbers of colours. Our algorithm is easily extendible to non-regular patterns in any coordinate system. Categories and Subject Descriptors (according to ACM CCS): I.3.8 [Computer Graphics]: Applications; I.3.m [Com- puter Graphics]: Miscellaneous—Visual Arts; J.5 [Arts and Humanities]: Fine Arts. 1. Introduction Random colour sampling in the spatially discrete space was used in the early twentieth-century by numerous artists such as Jean Arp, Sophie Tauber and Vilmos Huszár.
    [Show full text]
  • Eindhoven University of Technology MASTER Lateral Stiffness Of
    Eindhoven University of Technology MASTER Lateral stiffness of hexagrid structures de Meijer, J.H.M. Award date: 2012 Link to publication Disclaimer This document contains a student thesis (bachelor's or master's), as authored by a student at Eindhoven University of Technology. Student theses are made available in the TU/e repository upon obtaining the required degree. The grade received is not published on the document as presented in the repository. The required complexity or quality of research of student theses may vary by program, and the required minimum study period may vary in duration. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain ‘Lateral Stiffness of Hexagrid Structures’ - Master’s thesis – - Main report – - A 2012.03 – - O 2012.03 – J.H.M. de Meijer 0590897 July, 2012 Graduation committee: Prof. ir. H.H. Snijder (supervisor) ir. A.P.H.W. Habraken dr.ir. H. Hofmeyer Eindhoven University of Technology Department of the Built Environment Structural Design Preface This research forms the main part of my graduation thesis on the lateral stiffness of hexagrids. It explores the opportunities of a structural stability system that has been researched insufficiently.
    [Show full text]
  • Beyond Developable: Omputational Design and Fabrication with Auxetic Materials
    Beyond Developable: Computational Design and Fabrication with Auxetic Materials Mina Konakovic´ Keenan Crane Bailin Deng Sofien Bouaziz Daniel Piker Mark Pauly EPFL CMU University of Hull EPFL EPFL Figure 1: Introducing a regular pattern of slits turns inextensible, but flexible sheet material into an auxetic material that can locally expand in an approximately uniform way. This modified deformation behavior allows the material to assume complex double-curved shapes. The shoe model has been fabricated from a single piece of metallic material using a new interactive rationalization method based on conformal geometry and global, non-linear optimization. Thanks to our global approach, the 2D layout of the material can be computed such that no discontinuities occur at the seam. The center zoom shows the region of the seam, where one row of triangles is doubled to allow for easy gluing along the boundaries. The base is 3D printed. Abstract 1 Introduction We present a computational method for interactive 3D design and Recent advances in material science and digital fabrication provide rationalization of surfaces via auxetic materials, i.e., flat flexible promising opportunities for industrial and product design, engi- material that can stretch uniformly up to a certain extent. A key neering, architecture, art and science [Caneparo 2014; Gibson et al. motivation for studying such material is that one can approximate 2015]. To bring these innovations to fruition, effective computational doubly-curved surfaces (such as the sphere) using only flat pieces, tools are needed that link creative design exploration to material making it attractive for fabrication. We physically realize surfaces realization. A versatile approach is to abstract material and fabrica- by introducing cuts into approximately inextensible material such tion constraints into suitable geometric representations which are as sheet metal, plastic, or leather.
    [Show full text]
  • Visualization of Regular Maps
    Symmetric Tiling of Closed Surfaces: Visualization of Regular Maps Jarke J. van Wijk Dept. of Mathematics and Computer Science Technische Universiteit Eindhoven [email protected] Abstract The first puzzle is trivial: We get a cube, blown up to a sphere, which is an example of a regular map. A cube is 2×4×6 = 48-fold A regular map is a tiling of a closed surface into faces, bounded symmetric, since each triangle shown in Figure 1 can be mapped to by edges that join pairs of vertices, such that these elements exhibit another one by rotation and turning the surface inside-out. We re- a maximal symmetry. For genus 0 and 1 (spheres and tori) it is quire for all solutions that they have such a 2pF -fold symmetry. well known how to generate and present regular maps, the Platonic Puzzle 2 to 4 are not difficult, and lead to other examples: a dodec- solids are a familiar example. We present a method for the gener- ahedron; a beach ball, also known as a hosohedron [Coxeter 1989]; ation of space models of regular maps for genus 2 and higher. The and a torus, obtained by making a 6 × 6 checkerboard, followed by method is based on a generalization of the method for tori. Shapes matching opposite sides. The next puzzles are more challenging. with the proper genus are derived from regular maps by tubifica- tion: edges are replaced by tubes. Tessellations are produced us- ing group theory and hyperbolic geometry. The main results are a generic procedure to produce such tilings, and a collection of in- triguing shapes and images.
    [Show full text]
  • A Principled Approach to the Modelling of Kagome Weave Patterns for the Fabrication of Interlaced Lattice Structures Using Straight Strips
    Beyond the basket case: A principled approach to the modelling of kagome weave patterns for the fabrication of interlaced lattice structures using straight strips. Phil Ayres, Alison Grace Martin, Mateusz Zwierzycki Phil Ayres [email protected] CITA, Denmark Alison Grace Martin [email protected] Independant 3D Weaver, Italy Mateusz Zwierzycki [email protected] The Object, Poland Keywords: Kagome, triaxial weaving, basket weaving, textiles, mesh topology, mesh valence, mesh dual, fabrication, constraint modelling, constraint based simulation, design computation 72 AAG2018 73 Abstract This paper explores how computational methods of representation can support and extend kagome handcraft towards the fabrication of interlaced lattice structures in an expanded set of domains, beyond basket making. Through reference to the literature and state of the art, we argue that the instrumentalisation of kagome principles into computational design methods is both timely and relevant; it addresses a growing interest in such structures across design and engineering communities; it also fills a current gap in tools that facilitate design and fabrication investigation across a spectrum of expertise, from the novice to the expert. The paper describes the underlying topological and geometrical principles of kagome weave, and demonstrates the direct compatibility of these principles to properties of computational triangular meshes and their duals. We employ the known Medial Construction method to generate the weave pattern, edge ‘walking’ methods to consolidate geometry into individual strips, physics based relaxation to achieve a materially informed final geometry and projection to generate fabri- cation information. Our principle contribution is the combination of these methods to produce a principled workflow that supports design investigation of kagome weave patterns with the constraint of being made using straight strips of material.
    [Show full text]
  • A Continuous Coordinate System for the Plane by Triangular Symmetry
    Article A Continuous Coordinate System for the Plane by Triangular Symmetry Benedek Nagy 1,* and Khaled Abuhmaidan 2 Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, via Mersin 10, Turkey, Famagusta 99450, North Cyprus; [email protected] * Correspondence: [email protected] Received: 20 December 2018; Accepted: 31 January 2019; Published: 9 February 2019 Abstract: The concept of the grid is broadly used in digital geometry and other fields of computer science. It consists of discrete points with integer coordinates. Coordinate systems are essential for making grids easy to use. Up to now, for the triangular grid, only discrete coordinate systems have been investigated. These have limited capabilities for some image-processing applications, including transformations like rotations or interpolation. In this paper, we introduce the continuous triangular coordinate system as an extension of the discrete triangular and hexagonal coordinate systems. The new system addresses each point of the plane with a coordinate triplet. Conversion between the Cartesian coordinate system and the new system is described. The sum of three coordinate values lies in the closed interval [−1, 1], which gives many other vital properties of this coordinate system. Keywords: barycentric coordinate system; coordinate system; hexagonal grid; triangular grid; tri- hexagonal grid; transformations 1. Introduction The concept of the grid is essential and heavily used in digital geometry and in digital image processing. A grid is comprised of discrete points addressed with integer vectors. There are three regular tessellations of the plane, which define the square, hexagonal, and triangular grids (named after the form of the pixels used as tiles) [1].
    [Show full text]
  • Direct Generation of Regular-Grid Ground Surface Map from In-Vehicle Stereo Image Sequences
    2013 IEEE International Conference on Computer Vision Workshops Direct Generation of Regular-Grid Ground Surface Map From In-Vehicle Stereo Image Sequences Shigeki Sugimoto Kouma Motooka Masatoshi Okutomi Tokyo Institute of Technology 2–12–1–S5–22 Ookayama, Meguro-ku, Tokyo, 153–0834 Japan [email protected], [email protected], [email protected] Abstract ous real-time robot applications, including traversable area detection, path planning, and map extension. Our ultimate We propose a direct method for incrementally estimat- goal here is to develop an efficient method for incrementally ing a regular-grid ground surface map from stereo image estimating a DEM of a large ground area, no matter whether sequences captured by nearly front-looking stereo cameras, the target ground is off-road or not, from stereo image se- taking illumination changes on all images into considera- quences captured by in-vehicle nearly-front-looking stereo tion. At each frame, we simultaneously estimate a camera cameras. motion and vertex heights of the regular mesh, composed A DEM can be estimated by fitting a point cloud to a of piecewise triangular patches, drawn on a level plane in regular-grid surface model. Considered with the require- the ground coordinate system, by minimizing a cost repre- ment of computational efficiency in robotics, a possible senting the differences of the photometrically transformed choice is to fit a regular-grid surface to the sparse point pixel values in homography-related projective triangular cloud estimated by an efficient stereo SLAM technique (e.g. patches over three image pairs in a two-frame stereo im- [4, 8]), or to the denser point cloud estimated at each frame age sequence.
    [Show full text]
  • Data Representation in Visualisation
    Visualisation : Lecture 4 Data Representation in Visualisation Visualisation – Lecture 4 Taku Komura Institute for Perception, Action & Behaviour School of Informatics Taku Komura Data Representation 1 Visualisation : Lecture 4 Data Representation ● We have a system architecture for visualisation – the visualisation pipeline – rendering techniques ● Data is ........ – discrete (in representation) – structured / unstructured (e.g. grid / cloud) – of a specific dimension D (e.g. 2D / 3D) Taku Komura Data Representation 2 Visualisation : Lecture 4 Discrete vs. Continuous ● Real World is continuous ● Data is discrete – Computers are good in handling discrete data – discrete representation of a real world (of abstract) concept ● Difficult to visualise continuous shape from raw discrete sampling? – we need topology and interpolation Taku Komura Data Representation 3 Visualisation : Lecture 4 Interpolation & Topology ● If we introduce topology our visualisation of discrete data improves – The topology helps the visual system to do the interpolation Taku Komura Data Representation 4 Visualisation : Lecture 4 Topology ● Topology : relationships within the data invariant under geometric transformation (i.e. Orientation, translation) i.e. the information which vertex is connected to which edge, which face is composed of which edges , etc. Taku Komura Data Representation 5 Visualisation : Lecture 4 Interpolation & Topology ● What if these colour represented spatial temperature at these 8 discrete points? – e.g. colour scale blue(=cold)→green→red(
    [Show full text]
  • Recursive Tilings and Space-Filling Curves with Little Fragmentation
    Recursive tilings and space-filling curves with little fragmentation Herman Haverkort∗ October 24, 2018 Abstract This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number a such that any ball Q can be covered by a tiles (or curve sections) with total volume O(volume(Q)). Recursive tilings and space-filling curves with low Arrwwid numbers can be applied to optimise disk, memory or server access patterns when processing sets of points in Rd. This paper presents recursive tilings and space-filling curves with optimal Arrwwid numbers. For d 3, we see that regular cube tilings and space-filling curves cannot have optimal Arrwwid≥ number, and we see how to construct alternatives with better Arrwwid numbers. 1 Introduction 1.1 The problem Consider a set of data points in a bounded region U of R2, stored on disk. A standard operation on such point sets is to retrieve all points that lie inside a certain query range, for example a circle or a square. To prevent large delays because of disk head movements while answering such queries, it is desirable that the points are stored on disk in a clustered way [2, 9, 10, 11, 15]. Similar considerations arise when storing spatial data in certain types of distributed networks [19] or when scanning spatial objects to render them as a raster image; in the latter case it is desirable that the pixels that cover any particular object are scanned in a clustered way, so that the object does not have to be brought into cache too often [21].
    [Show full text]
  • A Continuous Coordinate System for the Plane by Triangular Symmetry
    S S symmetry Article A Continuous Coordinate System for the Plane by Triangular Symmetry Benedek Nagy * and Khaled Abuhmaidan Department of Mathematics, Faculty of Arts and Sciences, Eastern Mediterranean University, via Mersin 10, Turkey, Famagusta 99450, North Cyprus; [email protected] * Correspondence: [email protected] Received: 20 December 2018; Accepted: 31 January 2019; Published: 9 February 2019 Abstract: The concept of the grid is broadly used in digital geometry and other fields of computer science. It consists of discrete points with integer coordinates. Coordinate systems are essential for making grids easy to use. Up to now, for the triangular grid, only discrete coordinate systems have been investigated. These have limited capabilities for some image-processing applications, including transformations like rotations or interpolation. In this paper, we introduce the continuous triangular coordinate system as an extension of the discrete triangular and hexagonal coordinate systems. The new system addresses each point of the plane with a coordinate triplet. Conversion between the Cartesian coordinate system and the new system is described. The sum of three coordinate values lies in the closed interval [−1, 1], which gives many other vital properties of this coordinate system. Keywords: barycentric coordinate system; coordinate system; hexagonal grid; triangular grid; tri-hexagonal grid; transformations 1. Introduction The concept of the grid is essential and heavily used in digital geometry and in digital image processing. A grid is comprised of discrete points addressed with integer vectors. There are three regular tessellations of the plane, which define the square, hexagonal, and triangular grids (named after the form of the pixels used as tiles) [1].
    [Show full text]