<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Shapes of polyhedra and triangulations of the sphere · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_9801088/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/math_9801088/feed.xml" rel="self" type="application/rss+xml" /><item><title>Shapes of polyhedra and triangulations of the sphere — mentioned by mrcactu5</title><link>https://news.ycombinator.com/item?id=13348520</link><guid isPermaLink="false">urn:hackerpapers:mention:math_9801088:13348520</guid><pubDate>Sun, 08 Jan 2017 05:52:17 GMT</pubDate><description>&lt;p&gt;there are some nice fast computations of Julia sets in Python https://www.ibm.com/developerworks/community/blogs/jfp/entry... however one problem is always requires computing all the backwards iterates of the points. And there&amp;#x27;s never getting around that. these two ladies offer a means of approximating the Julia set using a polygon. I have no heard of this. there is a nice result by William Thurston they are using &amp;quot;Shapes of polyhedra and triangulations of the sphere&amp;quot; https://arxiv.org/abs/math/9801088 The theorem is exactly what the article says. They cut out this shape and fold it along the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_9801088/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.GT</category></item></channel></rss>
