<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2001.02581/</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/2001.02581/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes — mentioned by gspr</title><link>https://news.ycombinator.com/item?id=28278651</link><guid isPermaLink="false">urn:hackerpapers:mention:2001.02581:28278651</guid><pubDate>Mon, 23 Aug 2021 16:49:10 GMT</pubDate><description>&lt;p&gt;And for simplicial complexes there&amp;#x27;s a neat data structure: https://arxiv.org/abs/2001.02581 It&amp;#x27;s implemented (minus some features) in e.g. GUDHI.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2001.02581/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CG</category></item></channel></rss>
