computational geometry algorithms and applications

Perhaps the earliest calculation tool of human beings was the finger, but as the complexity of life and transactions increased, the finger could not meet the needs of counting, so the ancients created the method of " knotting rope to record things." Then, counting rods appeared. They were made of bamboo, wood, iron, jade, and other materials. They used the decimal system and calculated by placing and moving the rods. They could represent multi-digit numbers and do multiplication operations, and there were specific multi-digit number representation rules. The abacus evolved from the counting rod and was recognized as the earliest calculating instrument. The existing abacus had various shapes and materials. The most common one was the seven-bead abacus, with two beads on the top and five beads on the bottom. The abacus was simple and fast, and was widely used in China. In 1520 AD, the Englishman Gant invented the slide rule, which was composed of three parts: the upper and lower fixed ruler, the sliding ruler, and the vernier. It was mainly used for rough calculations in special operations. The accuracy of different slide rules varied. In 1822, the mechanical difference engine appeared. It could improve the speed of multiplication and the accuracy of digital tables, but it had many parts and was heavy. In 1944, scientists at the MIT Institute of Technology developed an electro-mechanical calculator that combined mechanical and electronic calculations. It had high accuracy and reliability, but it was large, heavy, inconvenient to carry, and costly. In the 18th century, the German mathematician Leibniz designed and manufactured a calculator that could perform addition, deduction, multiplication, division, and square root operations based on Pascal's invention. Since then, computer technology had developed into two paths. One was the development path of desktop machinery and large-scale mechanical computers, and the other was the development path of relaying as computer circuit components. After that, computers continued to develop on the basis of electronic components such as electron tubes and transistors. From transistor-based computers to integrated circuit computers, and then to ultra-large-scale integrated circuit computers, the computing power continued to increase. With the development of artificial intelligence, big data, and other technologies, the application of computing tools became more and more extensive. " A Short History of the Future: Legends of the Intelligent Era " was equally exciting. Everyone was welcome to click and read it!

Computational intelligence had the main characteristics of continuous evolution, environmental friendliness, and open ecology. Continuous evolution means having the ability to manage and upgrade itself; environmental friendliness means anywhere deployment, seamless connection, and efficient collaboration regardless of geographical location; open ecology means that many upstream and downstream parties in the industry can participate widely to create and share AI dividends. " A Short History of the Future: Legends of the Intelligent Era " was equally exciting. Everyone was welcome to click and read it!

Algorithms are often shown as flowcharts or sequences of steps in comics. It helps to visually explain the logical process.

Algorithms are often shown as complex systems or patterns in comics. They might be visualized as lines and symbols that represent data flow and processing.

" Manga algorithms: Xiao Hui's journey of algorithms " was a highly recommended introductory book for manga algorithms. Through the virtual protagonist Xiao Hui's mental journey, this book used the form of a comic to describe the basic knowledge of algorithms and data structures, complex and ever-changing algorithm interview questions, and the practical application of algorithms. It was especially suitable for beginners with zero foundation. It didn't matter even if they couldn't understand the code. They could understand the logical relationship and calculation method behind the code. The book also introduced the concepts of algorithms and data structures, how to analyze time complexity and space complexity, the most basic data structures, the concepts of trees and binaries, and the way to traverse them. There were also several typical sorting algorithms and popular algorithm interview questions. The book's Douban rating was 9.2, and it was very popular among readers. If you don't know anything about algorithms, this book can help you overcome your fear of them.