构造Kleinian群吸引子的一种新的指数化方法
A new indexed approach to render the attractors of Kleinian groups
摘要:
一个广泛的程序,以使吸引的克莱因集团,发表在著名的书“因陀罗的珍珠”,并根据组合树模型,需要巨大的内存资源来计算和存储所有的话需要。我们将在这里提出一个新的更快,更轻的版本,它放弃了原来的单词数组,并从整数中提取单词。
英文摘要:
One widespread procedure to render the attractor of Kleinian groups, published in the renown book "Indra's Pearls" and based upon a combinatorial tree model, wants huge memory resources to compute and store all the words required. We will present here a new faster and lighter version which drops the original words array and pulls out words from integer numbers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。