The computation of megamaps

DOI10.17377/SEMI.2013.10.015zbMATH Open1330.14057MaRDI QIDQ890988FDOQ890988

Authors: B. S. Bychkov 

Publication date: 16 November 2015

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1741033
• Computing cartograms with optimal complexity
• Computing cartograms with optimal complexity
• scientific article; zbMATH DE number 5262894
• Map Construction Algorithms
• Computing all maps into a sphere
• Computing all maps into a sphere
• On the computational complexities of various geography variants
• Computing the overlaps of two maps

zbMATH Keywords

braid groupdessin d'enfantramified coveringBeliy functionmegamap

Mathematics Subject Classification ID

Coverings of curves, fundamental group (14H30) Arithmetic aspects of dessins d'enfants, Bely? theory (11G32) Dessins d'enfants theory (14H57)

Cited In (5)

• Map Construction Algorithms
• Title not available (Why is that?)
• On rational functions whose normalization has genus zero or one
• Topological recursion for irregular spectral curves
• Computing stable Demers cartograms

This page was built for publication: The computation of megamaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890988)