<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://floppainspector.xyz/</id><title>Floppa's Guide</title><subtitle>floppa_inspector's personal notes, publicized for everyone's use.</subtitle> <updated>2025-08-08T19:33:26+09:00</updated> <author> <name>Leonardo Park</name> <uri>https://floppainspector.xyz/</uri> </author><link rel="self" type="application/atom+xml" href="https://floppainspector.xyz/feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://floppainspector.xyz/"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2025 Leonardo Park </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Topological Sorting and Kahn's Implementation</title><link href="https://floppainspector.xyz/posts/topological-sort/" rel="alternate" type="text/html" title="Topological Sorting and Kahn&amp;apos;s Implementation" /><published>2025-08-02T10:31:00+09:00</published> <updated>2025-08-02T10:45:48+09:00</updated> <id>https://floppainspector.xyz/posts/topological-sort/</id> <content type="text/html" src="https://floppainspector.xyz/posts/topological-sort/" /> <author> <name>Leonardo Park</name> </author> <category term="graph theory" /> <category term="DAG" /> <summary>What is topological sorting? This question has been haunting me for a while now. I did study SCCs once about 9 months back and I barely remember anything, so I decided to come back to the topic and try solving problems on this topic. But I know that a topological sorting is a prerequisite, and I’ve found the topic vague in terms of what it is, so I want to start off with clearly defining what ...</summary> </entry> <entry><title>Point in/on Convex Hull</title><link href="https://floppainspector.xyz/posts/point-in-on-convex-hull/" rel="alternate" type="text/html" title="Point in/on Convex Hull" /><published>2025-07-21T16:00:00+09:00</published> <updated>2025-07-21T16:00:00+09:00</updated> <id>https://floppainspector.xyz/posts/point-in-on-convex-hull/</id> <content type="text/html" src="https://floppainspector.xyz/posts/point-in-on-convex-hull/" /> <author> <name>Leonardo Park</name> </author> <category term="geometry" /> <category term="convex hull" /> <summary>Polygon Sectoring A prerequisite is knowing that we clearly have a polygon, since if not the problem doesn’t even hold. We also have to have a clear polygon constructed. Refer to this page for more information on that topic. Also note that following our method of construction, we already have a good order so that the leftmost bottommost point is set as $\text{hull}[0]$. Setting this as a sort...</summary> </entry> <entry><title>Convex Hull Construction</title><link href="https://floppainspector.xyz/posts/convex-hull-construction/" rel="alternate" type="text/html" title="Convex Hull Construction" /><published>2025-07-21T13:00:00+09:00</published> <updated>2025-07-21T13:00:00+09:00</updated> <id>https://floppainspector.xyz/posts/convex-hull-construction/</id> <content type="text/html" src="https://floppainspector.xyz/posts/convex-hull-construction/" /> <author> <name>Leonardo Park</name> </author> <category term="geometry" /> <category term="convex hull" /> <summary>Judge link Constructing the Hull by the Monotone Chain Algorithm An intuitive property of the convex hull is that while we go counter clockwise around the edges, the edges themselves form a counter clockwise rotation. This means that construction itself should be done so that this property holds. Refer to the diagram below: The $A_0 \to B \to C$ path is valid, and creates a convex hull. Ho...</summary> </entry> <entry><title>Let's start here.</title><link href="https://floppainspector.xyz/posts/lets-start-here/" rel="alternate" type="text/html" title="Let&amp;apos;s start here." /><published>2025-07-21T00:00:00+09:00</published> <updated>2025-07-21T00:00:00+09:00</updated> <id>https://floppainspector.xyz/posts/lets-start-here/</id> <content type="text/html" src="https://floppainspector.xyz/posts/lets-start-here/" /> <author> <name>Leonardo Park</name> </author> <category term="life" /> <summary>What’s been going on? After an exhausting week of finals and wrapping up the school semester, I’ve been busy with this and that. But as I study more and more about programming, I start to realize how broad and difficult the subject is, and that I’m not as good as I think. This really hit me after participating in this year’s KOI - which I wasn’t originally planning to. I was unconfident about ...</summary> </entry> </feed>
