A new indexed approach to render the attractors of Kleinian groups

09/23/2017
by   Alessandro Rosa, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/03/2019

Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words

We introduce a variation of the Ziv-Lempel and Crochemore factorizations...
07/28/2019

Minimal Absent Words in Rooted and Unrooted Trees

We extend the theory of minimal absent words to (rooted and unrooted) tr...
01/27/2016

Co-Occurrence Patterns in the Voynich Manuscript

The Voynich Manuscript is a medieval book written in an unknown script. ...
06/12/2018

A Timed Version of the Plactic Monoid

Timed words are words where letters of the alphabet come with time stamp...
11/27/2017

New Covering Array Numbers

A covering array CA(N; t; k; v) is an N x k array on v symbols such that...
03/06/2020

NYTWIT: A Dataset of Novel Words in the New York Times

We present the New York Times Word Innovation Types dataset, or NYTWIT, ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.