在数学定义中,递归是十分常见的,如fibonacci数列(斐波那契数列)。
Definitions in mathematics are often given recursively. For instance, the Fibonacci sequence is defined recursively.
此模型的数学定义清晰,易于计算机实现,能够有效完成形态搜索的自动化。
This model has an explicit mathematical definition and can effectively implement the automation of shape search.
基于严格的数学定义,该模型不仅能创造优美的视觉图像,也能对其进行灵活控制。
Based on its solid mathematical definition, DBBS provides not only visually appealing shapes but also flexible manipulations.
应用推荐