Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences

DOI10.1007/978-3-030-14085-4_35OpenAlexW2918107394MaRDI QIDQ5237090

Igor Potapov, Haomin Song

Publication date: 16 October 2019

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_35

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric computations by broadcasting automata
• Local convergence of Newton's method under majorant condition
• Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
• Octagonal distances for digital pictures
• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• Distance functions in digital geometry
• Distance functions based on multiple types of weighted steps combined with neighborhood sequences
• Digital straightness -- a review
• Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
• Broadcasting Automata and Patterns on ℤ2
• On the Chamfer Polygons on the Triangular Grid

This page was built for publication: Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences