<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Reconstructing Curves from Points and Tangents · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0903.1817/</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/0903.1817/feed.xml" rel="self" type="application/rss+xml" /><item><title>Reconstructing Curves from Points and Tangents — mentioned by yummyfajitas</title><link>https://news.ycombinator.com/item?id=5551251</link><guid isPermaLink="false">urn:hackerpapers:mention:0903.1817:5551251</guid><pubDate>Mon, 15 Apr 2013 13:09:09 GMT</pubDate><description>&lt;p&gt;Numba is great for numerical expressions, but I&amp;#x27;d be surprised if it works for trickier bits. For example, consider the problem here: http://arxiv.org/abs/0903.1817 Ultimately I needed to run a math formula on some surfels and connect an edge in a graph if the formula came out True. Following that I had to prune a bunch of edges in the graph. In 2009 (when I did it), I had to drop down to c++. (Admittedly, this was also partly due to a lack of a good python graph lib.) I&amp;#x27;d be very surprised if Numba is helpful with something like that - the branching and complex data structures don&amp;#x27;t seem…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0903.1817/"&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>
