Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
From MaRDI portal
Publication:630602
DOI10.1016/j.tcs.2010.10.028zbMath1207.68421OpenAlexW2036079234MaRDI QIDQ630602
Publication date: 17 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2437/100132
approximationfinite automataformal systemsdigital geometrydigital circlesdigital distanceneighbourhood sequences
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (5)
On covering a digital disc with concentric circles in \(\mathbb Z^2\) ⋮ Non-traditional 2D grids in combinatorial imaging -- advances and challenges ⋮ Application of neighborhood sequences in communication of hexagonal networks ⋮ Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid ⋮ Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Discrete images, objects, and functions in \(Z^ n\)
- Octagonal distances for digital pictures
- Distances based on neighbourhood sequences in non-standard three-dimensional grids
- Distance functions in digital geometry
- General neighborhood sequences in \(\mathbb Z^n\)
- Geometry of Neighborhood Sequences in Hexagonal Grid
This page was built for publication: Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
