<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: delhanty</title><link>https://news.ycombinator.com/user?id=delhanty</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 06 May 2026 22:43:46 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=delhanty" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by delhanty in "Peter Sarnak – The Riemann Hypothesis [video]"]]></title><description><![CDATA[
<p>2026-04-15 (10 days ago) Millennium Prize Problems Lecture posted yesterday on YouTube - watched 10 minutes so far - seems good level for HN - non-trivial but also no need to be a specialist in analytic number theory</p>
]]></description><pubDate>Sat, 25 Apr 2026 00:29:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=47897448</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=47897448</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47897448</guid></item><item><title><![CDATA[Peter Sarnak – The Riemann Hypothesis [video]]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.youtube.com/watch?v=DtaFyE9BcXw">https://www.youtube.com/watch?v=DtaFyE9BcXw</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47897447">https://news.ycombinator.com/item?id=47897447</a></p>
<p>Points: 4</p>
<p># Comments: 1</p>
]]></description><pubDate>Sat, 25 Apr 2026 00:29:09 +0000</pubDate><link>https://www.youtube.com/watch?v=DtaFyE9BcXw</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=47897447</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47897447</guid></item><item><title><![CDATA[New comment by delhanty in "Gerd Faltings, who proved the Mordell conjecture, wins the Abel Prize"]]></title><description><![CDATA[
<p>> Mordel's conjecture implies as a special case that for all n>=4 there are only a finite number of solutions to Fermat's equations with relative prime numbers<p>I just learnt that fact from Wikipedia's article on Mordel's conjecture (now Faltings' theorem), was curious whether the theorem could be strengthened to obtain a full proof of Fermat’s Last Theorem (FLT) that is genuinely different from the Taylor–Wiles proof (or its later variants) and so asked an AI (in this case Grok via Twitter).<p>Grok correctly told me "no it's not possible", but then  surfaced (as an aside) a nice expository article on the Taylor–Wiles proof by Faltings from AMS notices in July 1995, which I thought I'd share here:<p><a href="https://www.ams.org/notices/199507/faltings.pdf" rel="nofollow">https://www.ams.org/notices/199507/faltings.pdf</a></p>
]]></description><pubDate>Tue, 24 Mar 2026 23:51:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=47511264</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=47511264</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47511264</guid></item><item><title><![CDATA[New comment by delhanty in "The Shape of Inequalities"]]></title><description><![CDATA[
<p>Oh, these are really nice Andrei!  Thanks for posting them.</p>
]]></description><pubDate>Fri, 20 Mar 2026 01:29:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=47449198</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=47449198</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47449198</guid></item><item><title><![CDATA[New comment by delhanty in "Biconnected components"]]></title><description><![CDATA[
<p>Thank you for the reply - appreciated.</p>
]]></description><pubDate>Wed, 24 Sep 2025 12:07:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=45359179</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=45359179</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45359179</guid></item><item><title><![CDATA[New comment by delhanty in "Biconnected components"]]></title><description><![CDATA[
<p>For the vertex biconnected components can you say how your implementation compares technically with Boost Graph library's `biconnected_components` and `articulation_points`?<p><a href="https://www.boost.org/library/latest/graph/" rel="nofollow">https://www.boost.org/library/latest/graph/</a><p><a href="https://www.boost.org/doc/libs/latest/libs/graph/doc/biconnected_components.html" rel="nofollow">https://www.boost.org/doc/libs/latest/libs/graph/doc/biconne...</a><p>Am I correct to suppose both are C++ implementations of Tarjan's algorithm?</p>
]]></description><pubDate>Tue, 23 Sep 2025 04:56:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=45342989</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=45342989</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45342989</guid></item><item><title><![CDATA[New comment by delhanty in "Rasterizer: A GPU-accelerated 2D vector graphics engine in ~4k LOC"]]></title><description><![CDATA[
<p>Thank you very much for that concise explanation.</p>
]]></description><pubDate>Fri, 05 Sep 2025 11:12:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=45137261</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=45137261</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45137261</guid></item><item><title><![CDATA[New comment by delhanty in "Rasterizer: A GPU-accelerated 2D vector graphics engine in ~4k LOC"]]></title><description><![CDATA[
<p>Congratulations!<p>Can you say how the it's similar and how it's different to superficially similar sounding work?<p>(1) <a href="https://github.com/linebender/vello" rel="nofollow">https://github.com/linebender/vello</a> , dual Apache/MIT, by Raph Levien et al<p>(2) <a href="https://sluglibrary.com/" rel="nofollow">https://sluglibrary.com/</a> , proprietary, by Eric Lengyel (Terathon)</p>
]]></description><pubDate>Wed, 03 Sep 2025 11:12:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=45114409</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=45114409</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45114409</guid></item><item><title><![CDATA[New comment by delhanty in "Dropbox Passwords Discontinuation"]]></title><description><![CDATA[
<p>> They introduced a feature that took me hours and hours to disable (the file not downloaded until you try to open it thing). One bit of documentation pretty much lied about turning it off. Turned out it had to be disabled in more than one place.<p>Are you able to say what the relevant settings are?  (I would like to be able to do that too ...)</p>
]]></description><pubDate>Fri, 22 Aug 2025 00:51:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=44979962</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=44979962</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44979962</guid></item><item><title><![CDATA[New comment by delhanty in "Why I left my tech job to work on chronic pain"]]></title><description><![CDATA[
<p>As someone who has been mitigating and managing chronic pain for 25 years, with respect IMO your expectation is unrealistic.<p>There isn't a "solution" - you're looking at a life-long mitigation and management strategy that will not be "brief".<p>The time commitment typically goes up as one ages.  I could spend 40 hours a week on nutrition, exercise and relaxation if I was trying to optimize for chronic pain reduction.<p>But then nothing else would get done.</p>
]]></description><pubDate>Fri, 04 Jul 2025 23:40:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=44468906</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=44468906</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44468906</guid></item><item><title><![CDATA[New comment by delhanty in "History of CAD"]]></title><description><![CDATA[
<p>>Becoming a book publisher wasn’t on my bingo card when I started Shapr3D. Yet here we go! For now, it’s only available to select customers—but if there’s enough interest, we’ll make it accessible to the public. The book spans 860 pages and weighs approximately 3 kg—just as heavy as CAD is.<p>Become a select customer of Shapr3D and their CEO István Csanády might send you one.<p><a href="https://twitter.com/istvan_csanady/status/1888298612167225663" rel="nofollow">https://twitter.com/istvan_csanady/status/188829861216722566...</a></p>
]]></description><pubDate>Tue, 25 Feb 2025 13:58:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=43171921</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=43171921</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43171921</guid></item><item><title><![CDATA[New comment by delhanty in "History of CAD"]]></title><description><![CDATA[
<p>Seeing as David Weisberg's "History of CAD" is trending today I submitted "History of Unigraphics" by 3 of the original Unigraphics 7 dwarfs.<p>Edit: Unigraphics X SDRC became the system we know today as Siemens NX<p>It came out at the end of 2024 - these guys must all be around 80 by now.<p><a href="https://news.ycombinator.com/item?id=43169194">https://news.ycombinator.com/item?id=43169194</a></p>
]]></description><pubDate>Tue, 25 Feb 2025 07:59:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=43169363</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=43169363</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43169363</guid></item><item><title><![CDATA[New comment by delhanty in "Unigraphics, 1974–2001"]]></title><description><![CDATA[
<p>Seeing as David Weisberg's "History of CAD" is trending today, I submitted "History of Unigraphics" by 3 of the original Unigraphics 7 dwarfs.<p>The article came out at the end of 2024 ... these guys must all be around 80 by now.<p>Edit: Unigraphics X SDRC became the system we know today as Siemens NX</p>
]]></description><pubDate>Tue, 25 Feb 2025 07:30:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=43169195</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=43169195</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43169195</guid></item><item><title><![CDATA[Unigraphics, 1974–2001]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.computer.org/csdl/magazine/an/2024/04/10679561/20b3j9K7tMA">https://www.computer.org/csdl/magazine/an/2024/04/10679561/20b3j9K7tMA</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43169194">https://news.ycombinator.com/item?id=43169194</a></p>
<p>Points: 10</p>
<p># Comments: 2</p>
]]></description><pubDate>Tue, 25 Feb 2025 07:30:26 +0000</pubDate><link>https://www.computer.org/csdl/magazine/an/2024/04/10679561/20b3j9K7tMA</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=43169194</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43169194</guid></item><item><title><![CDATA[New comment by delhanty in "Show HN: Hestus – AI Copilot for CAD"]]></title><description><![CDATA[
<p>"fully constrained" means that there are no degrees of freedom left so that there are only a finite number of valid solutions, which are then consequently disconnected in the space of possible solutions.<p>DCM then chooses one valid solution that it believes is "close" to initial supplied positions/directions/radii etc for the geometry.</p>
]]></description><pubDate>Tue, 03 Sep 2024 23:57:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=41440500</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=41440500</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41440500</guid></item><item><title><![CDATA[New comment by delhanty in "Show HN: Hestus – AI Copilot for CAD"]]></title><description><![CDATA[
<p>Good luck guys!  I watched the video on YT - hopefully will get around to trying the Fusion 360 add-in at some point.<p>Does the current add-in use AI at all?<p>What is your plan when, in the event of you getting some traction, Autodesk etc. copy you innovations into the main product?<p>As per my other comments [1][2], I worked on this area at D-Cubed and Solidworks from 1995 to 2002.  Feel free to connect with me via twitter DM @delhanty [3].<p>[1] <a href="https://news.ycombinator.com/item?id=41440016">https://news.ycombinator.com/item?id=41440016</a><p>[2] <a href="https://news.ycombinator.com/item?id=41440150">https://news.ycombinator.com/item?id=41440150</a><p>[3] <a href="https://twitter.com/delhanty" rel="nofollow">https://twitter.com/delhanty</a></p>
]]></description><pubDate>Tue, 03 Sep 2024 23:41:38 +0000</pubDate><link>https://news.ycombinator.com/item?id=41440417</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=41440417</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41440417</guid></item><item><title><![CDATA[New comment by delhanty in "Show HN: Hestus – AI Copilot for CAD"]]></title><description><![CDATA[
<p>> Wonder if the 2D sketch experience is much better in Onshape, NX, Catia, etc?<p>Well those systems and pretty much all of the mechanical CAD industry is built upon D-Cubed's DCM, so I'd expect the behaviour to be the same.<p>If I was creating a new 3D CAD system from scratch now I'd probably license Parasolid eventually, but I'd pass on DCM.<p>I don't want to dump on D-Cubed and John Owen though.  I have huge respect for him and the company he created.  This is technical criticism with the benefit of hindsight.</p>
]]></description><pubDate>Tue, 03 Sep 2024 23:12:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=41440254</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=41440254</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41440254</guid></item><item><title><![CDATA[New comment by delhanty in "Show HN: Hestus – AI Copilot for CAD"]]></title><description><![CDATA[
<p>> And if this add-in becomes popular, Autodesk can trivially release something that has the same functionality, built into Fusion 360 by default. And, as you are no doubt painfully aware, the Fusion API can be limiting.<p>This is always the problem with add-ins like this as a business - you're essentially doing free market research for the application vendor.</p>
]]></description><pubDate>Tue, 03 Sep 2024 23:09:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=41440237</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=41440237</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41440237</guid></item><item><title><![CDATA[New comment by delhanty in "Show HN: Hestus – AI Copilot for CAD"]]></title><description><![CDATA[
<p>> The Fusion sketch solver is badly compromised, it can't do more than two or so simple successive Tangent relations without bugging out. And, my experience with Solidworks is the same, not sure if this is still true.<p>In my experience of building a sketcher at D-Cubed for a consultancy client (1995-2000) on top of D-Cubed's DCM, this is because DCM's curves (which are unbounded BTW) are not directed so that there are lots of erroneous solutions to attempting to constrain G1 chains of tangent bounded curves.  For example the Apollonius Problem [1][2] of 3 tangent circles/lines has 2^3 = 8 solutions.  IMO if John Owen had chosen directed curves for DCM then dragging configurations of tangent circles would be more stable.<p>I'll end with a quote from the Preface of Julian Lowell Coolidge's 1916 "A Treatise on the Circle and the Sphere" [3]:<p>> Among the cartesian theorems there is a sharp sub-division between those where the radius is looked upon as essentially signless and those where a positive or negative radius is allowed.<p>[1] <a href="https://mathworld.wolfram.com/ApolloniusProblem.html" rel="nofollow">https://mathworld.wolfram.com/ApolloniusProblem.html</a><p>[2] <a href="https://observablehq.com/@d3/apollonius-problem#" rel="nofollow">https://observablehq.com/@d3/apollonius-problem#</a><p>[3] <a href="https://en.wikipedia.org/wiki/A_Treatise_on_the_Circle_and_the_Sphere" rel="nofollow">https://en.wikipedia.org/wiki/A_Treatise_on_the_Circle_and_t...</a></p>
]]></description><pubDate>Tue, 03 Sep 2024 22:55:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=41440150</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=41440150</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41440150</guid></item><item><title><![CDATA[New comment by delhanty in "Show HN: Hestus – AI Copilot for CAD"]]></title><description><![CDATA[
<p>> I've been using parametric CAD (Pro/E / Creo, Solidworks, and Onshape) for 30+ years.<p>True - I implemented the first Solidworks Autodimension sketch as a contractor around 2002 based upon earlier work that I'd done for a consultancy client at D-Cubed in the late 1990s.  I'm sure it could be improved with AI and a large data set of sketches though.<p>> Solidworks tries to help with this in the form of cycling through what it thinks are the most likely constraints to remove and then re-solving the sketch. It's OK, but that sort of tool could be better.<p>I agree it could be better.  The behavior with under-constrained sketches depends on D-Cubed's DCM, and I seem to recall they were rather floppy.  It seems kind of ridiculous to make users jump through the hoops of making sketches fully constrained once they've added the constraints they care about.</p>
]]></description><pubDate>Tue, 03 Sep 2024 22:35:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=41440016</link><dc:creator>delhanty</dc:creator><comments>https://news.ycombinator.com/item?id=41440016</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41440016</guid></item></channel></rss>