• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter
Journal of Algorithms and Computation
Articles in Press
Current Issue
Journal Archive
Volume Volume 51 (2019)
Volume Volume 50 (2018)
Volume Volume 49 (2017)
Issue Issue 2
December 2017
Issue Issue 1
June 2017
Volume Volume 48 (2016)
Volume Volume 47 (2016)
Volume Volume 46 (2015)
Volume Volume 45 (2014)
Volume Volume 44 (2013)
Volume Volume 43 (2009)
Volume Volume 42 (2008)
Volume Volume 41 (2007)
Rosa, A. (2017). A new indexed approach to render the attractors of Kleinian groups. Journal of Algorithms and Computation, 49(2), 53-62.
Alessandro Rosa. "A new indexed approach to render the attractors of Kleinian groups". Journal of Algorithms and Computation, 49, 2, 2017, 53-62.
Rosa, A. (2017). 'A new indexed approach to render the attractors of Kleinian groups', Journal of Algorithms and Computation, 49(2), pp. 53-62.
Rosa, A. A new indexed approach to render the attractors of Kleinian groups. Journal of Algorithms and Computation, 2017; 49(2): 53-62.

A new indexed approach to render the attractors of Kleinian groups

Article 6, Volume 49, Issue 2, December 2017, Page 53-62  XML PDF (510.74 K)
Document Type: Research Paper
Author
Alessandro Rosa email
Software Developer
Abstract
One widespread procedure to render the attractor of Kleinian groups, appearing in the renown book [8], wants
huge memory resources to compute and store the results. We present a new faster and lighter version that drops the original array and pulls out group elements from integers.
Statistics
Article View: 334
PDF Download: 267
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

This work is licensed under a Creative Commons Attribution 4.0 International License
Journal Management System. Designed by sinaweb.