<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: nickponline</title><link>https://news.ycombinator.com/user?id=nickponline</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 28 Apr 2026 21:17:13 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=nickponline" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Show HN: Speed Miners – A tiny RTS resource mini-game]]></title><description><![CDATA[
<p>I've always loved RTS games and wanted to make a game similar for a long time. I thought I'd just try and build a mini / puzzle game around the resource gathering aspects of an RTS.<p>Objective: You have a base at the center and you need to mine and "refine" all of the resources on the map in as short a time as possible.<p>By default, the game will play automatically, but not optimally (moving and buying  upgrades). You can disable that with the buttons. You can select drones and right click to move them to specific resources patches and buy upgrades as you earn upgrade points.<p>I've implemented three different levels and some basic sounds. I used Phaser at the game library (first time using it). It won't work well on a mobile.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46662399">https://news.ycombinator.com/item?id=46662399</a></p>
<p>Points: 49</p>
<p># Comments: 8</p>
]]></description><pubDate>Sat, 17 Jan 2026 21:40:53 +0000</pubDate><link>https://speedminers.fun/</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=46662399</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46662399</guid></item><item><title><![CDATA[Show HN: Various shape regularization algorithms]]></title><description><![CDATA[
<p>I deal with a lot of geometry stuff at work with computer vision and photogrammetry, which usually comes from the real world. It's seldom clean and neat, and I'm often trying to find a way to "make it nice" or "make it pretty". I've always struggled with what that really means formally.<p>That led me to shape regularization (a technique used in computational geometry to clean up geometric data). CGAL had implemented a few methods for that, but there are more ways to do it, which I thought were nice. Also I typically work in Python, so it was nice to have a pure Python library could handle this.<p>I struggled to get the first version working as a QP. At a high level most of these boil down to minimizing a cost A + B where A is the cost associated the geometry and goes up the more you move it, and B is the cost associated "niceness" or rather the constraints you impose, and goes down the more you impose them. Then you try and minimize A + B or rather H<i>A + (1-H)</i>B where H is a hyper-parameter that controls the relative importance of A and B.<p>I needed a Python implementation so started with the examples implemented in CGAL then added a couple more for snap and joint regularization and metric regularization.</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46549333">https://news.ycombinator.com/item?id=46549333</a></p>
<p>Points: 78</p>
<p># Comments: 5</p>
]]></description><pubDate>Fri, 09 Jan 2026 02:13:01 +0000</pubDate><link>https://github.com/nickponline/shreg</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=46549333</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46549333</guid></item><item><title><![CDATA[New comment by nickponline in "enclose.horse"]]></title><description><![CDATA[
<p>Ah yes quite right.</p>
]]></description><pubDate>Tue, 06 Jan 2026 16:51:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=46514785</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=46514785</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46514785</guid></item><item><title><![CDATA[New comment by nickponline in "enclose.horse"]]></title><description><![CDATA[
<p>I think this problem is called the maximum-weight closure and can be solved as max flow. You want to find a cut between source (horse) so they were no out-going edges not in the cut (escape routes).</p>
]]></description><pubDate>Tue, 06 Jan 2026 16:09:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=46514160</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=46514160</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46514160</guid></item><item><title><![CDATA[New comment by nickponline in "The GJK Algorithm: A weird and beautiful way to do a simple thing"]]></title><description><![CDATA[
<p>I did a blog post of something related with Minkowski geometry: <a href="https://nickp.svbtle.com/asteroid-intersections" rel="nofollow">https://nickp.svbtle.com/asteroid-intersections</a></p>
]]></description><pubDate>Wed, 12 Jun 2024 23:12:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=40664205</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=40664205</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40664205</guid></item><item><title><![CDATA[New comment by nickponline in "The SR-71 Blackbird Astro-Nav System worked by tracking the stars"]]></title><description><![CDATA[
<p>I did a toy implementation of a star camera: <a href="https://nickp.svbtle.com/star-cameras" rel="nofollow noreferrer">https://nickp.svbtle.com/star-cameras</a></p>
]]></description><pubDate>Mon, 25 Sep 2023 23:48:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=37652382</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=37652382</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=37652382</guid></item><item><title><![CDATA[New comment by nickponline in "Ask HN: Could you share your personal blog here?"]]></title><description><![CDATA[
<p><a href="https://nickp.svbtle.com/" rel="nofollow noreferrer">https://nickp.svbtle.com/</a><p>I try to deconstruct and solve interesting coding problems usually from programming competitions.</p>
]]></description><pubDate>Tue, 04 Jul 2023 17:01:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=36589395</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=36589395</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=36589395</guid></item><item><title><![CDATA[New comment by nickponline in "The unreasonable effectiveness of conditional probabilities"]]></title><description><![CDATA[
<p>I wrote a blog about the general case <a href="https://nickp.svbtle.com/general-collectors-problem" rel="nofollow">https://nickp.svbtle.com/general-collectors-problem</a></p>
]]></description><pubDate>Wed, 22 Feb 2023 20:23:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=34902072</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=34902072</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=34902072</guid></item><item><title><![CDATA[New comment by nickponline in "Ask HN: Great Blogs by Programmers"]]></title><description><![CDATA[
<p>Shameless plug on my blog on solving and visualizing problems:
<a href="https://nickp.svbtle.com/" rel="nofollow">https://nickp.svbtle.com/</a></p>
]]></description><pubDate>Mon, 07 Feb 2022 18:17:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=30248784</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=30248784</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30248784</guid></item><item><title><![CDATA[New comment by nickponline in "Primel – guess a 5 digit prime number – each guess must be a prime"]]></title><description><![CDATA[
<p>My first inclination was to write a solver :)<p><a href="https://gist.github.com/nickponline/9a3fb1ee5333c52ed195625ea17c15b2" rel="nofollow">https://gist.github.com/nickponline/9a3fb1ee5333c52ed195625e...</a></p>
]]></description><pubDate>Fri, 21 Jan 2022 18:28:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=30027835</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=30027835</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30027835</guid></item><item><title><![CDATA[New comment by nickponline in "Primel: The “fun” “game” where you guess a 5 digit prime number."]]></title><description><![CDATA[
<p><a href="https://gist.github.com/nickponline/9a3fb1ee5333c52ed195625ea17c15b2" rel="nofollow">https://gist.github.com/nickponline/9a3fb1ee5333c52ed195625e...</a></p>
]]></description><pubDate>Fri, 21 Jan 2022 18:27:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=30027821</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=30027821</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30027821</guid></item><item><title><![CDATA[New comment by nickponline in "Ask HN: Who is hiring? (November 2021)"]]></title><description><![CDATA[
<p>DroneDeploy | Javascript, Python, Ops & 3D Engineers | REMOTE | www.dronedeploy.com | Full Time<p>DroneDeploy is the world leading site reality platform. We transform job sites, structures, and assets into easy-to-understand digital twins, generating valuable insights for industries including construction, energy, and agriculture. By turning the physical world into the digital, DroneDeploy helps save time and lower unforeseen costs. To learn more, visit www.dronedeploy.com and join the conversation on Twitter @DroneDeploy.<p>We have an inspiring company culture and are recognized as a Great Place to Work by Forbes, San Francisco Business Times, and Inc. Magazine. Our employees span the globe and operate under a hybrid workplace model. Some employees work remotely from home while others work via a physical office several times a week.<p>DroneDeploy is committed to an inclusive, accessible and supportive work environment. Our success and our growth come from the rich diversity of ideas from our employees, which is why we're so strongly committed to promoting from within. We make sure that our people have a myriad of opportunities to grow professionally and thrive personally. Flexible working hours, family benefits and remote work are just a few examples of our commitment to supporting our team members.<p><a href="https://www.dronedeploy.com/about/join-the-team/" rel="nofollow">https://www.dronedeploy.com/about/join-the-team/</a></p>
]]></description><pubDate>Mon, 01 Nov 2021 17:05:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=29069618</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=29069618</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=29069618</guid></item><item><title><![CDATA[New comment by nickponline in "Poisson's Equation"]]></title><description><![CDATA[
<p>Maybe you'll like these: <a href="https://nickp.svbtle.com/" rel="nofollow">https://nickp.svbtle.com/</a> (shameless plug)</p>
]]></description><pubDate>Tue, 06 Jul 2021 22:24:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=27755159</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=27755159</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=27755159</guid></item><item><title><![CDATA[New comment by nickponline in "Mathematics for Programmers [pdf]"]]></title><description><![CDATA[
<p>I would also recommend Concrete Mathematics by Donald Knuth, Oren Patashnik, and Ronald Graham as another refreshing approach.</p>
]]></description><pubDate>Thu, 24 Sep 2020 03:56:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=24575098</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=24575098</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=24575098</guid></item><item><title><![CDATA[A Challenging Combinatorics Problem]]></title><description><![CDATA[
<p>Article URL: <a href="https://nickp.svbtle.com/gem-island">https://nickp.svbtle.com/gem-island</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=24411107">https://news.ycombinator.com/item?id=24411107</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 08 Sep 2020 18:14:44 +0000</pubDate><link>https://nickp.svbtle.com/gem-island</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=24411107</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=24411107</guid></item><item><title><![CDATA[New comment by nickponline in "Atlas: End-to-End 3D Scene Reconstruction from Posed Images"]]></title><description><![CDATA[
<p>Is there anything that would prevent this approach working on 360 video?</p>
]]></description><pubDate>Wed, 12 Aug 2020 18:00:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=24134864</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=24134864</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=24134864</guid></item><item><title><![CDATA[New comment by nickponline in "Time of maximum intersection of two moving polygons"]]></title><description><![CDATA[
<p>Thanks for the kind words. I was actually looking for a better blogging platform as things weren't really discoverable on svbtle and then kind of forgot about it. But I've resumed it this year.</p>
]]></description><pubDate>Thu, 02 Jul 2020 17:42:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=23715868</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=23715868</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=23715868</guid></item><item><title><![CDATA[New comment by nickponline in "Computing furthest point from vertex in a polygon"]]></title><description><![CDATA[
<p>I'd be really interested to know if this can be computed directly any other way?</p>
]]></description><pubDate>Thu, 02 Jul 2020 00:00:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=23708331</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=23708331</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=23708331</guid></item><item><title><![CDATA[Computing furthest point from vertex in a polygon]]></title><description><![CDATA[
<p>Article URL: <a href="https://nickp.svbtle.com/socially-distant-polygons">https://nickp.svbtle.com/socially-distant-polygons</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=23708278">https://news.ycombinator.com/item?id=23708278</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 01 Jul 2020 23:53:06 +0000</pubDate><link>https://nickp.svbtle.com/socially-distant-polygons</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=23708278</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=23708278</guid></item><item><title><![CDATA[Time of maximum intersection of two moving polygons]]></title><description><![CDATA[
<p>Article URL: <a href="https://nickp.svbtle.com/asteroid-intersections">https://nickp.svbtle.com/asteroid-intersections</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=23673900">https://news.ycombinator.com/item?id=23673900</a></p>
<p>Points: 35</p>
<p># Comments: 3</p>
]]></description><pubDate>Mon, 29 Jun 2020 02:48:23 +0000</pubDate><link>https://nickp.svbtle.com/asteroid-intersections</link><dc:creator>nickponline</dc:creator><comments>https://news.ycombinator.com/item?id=23673900</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=23673900</guid></item></channel></rss>