<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator><link href="https://hit9.dev/feed.xml" rel="self" type="application/atom+xml" /><link href="https://hit9.dev/" rel="alternate" type="text/html" /><updated>2025-10-12T16:59:14+08:00</updated><id>https://hit9.dev/feed.xml</id><title type="html">春水煎茶</title><subtitle>王超的个人博客</subtitle><entry><title type="html">2D 网格上基于四叉树的分层 A* 寻路</title><link href="https://hit9.dev/post/pathfinding-quadtree-astar" rel="alternate" type="text/html" title="2D 网格上基于四叉树的分层 A* 寻路" /><published>2024-08-26T18:10:00+08:00</published><updated>2024-08-26T18:10:00+08:00</updated><id>https://hit9.dev/post/pathfinding-quadtree-astar</id><author><name></name></author><summary type="html"><![CDATA[]]></summary></entry><entry><title type="html">四叉树的思路、优化 和 C++ 实现</title><link href="https://hit9.dev/post/quadtree" rel="alternate" type="text/html" title="四叉树的思路、优化 和 C++ 实现" /><published>2024-08-04T00:00:00+08:00</published><updated>2024-08-04T00:00:00+08:00</updated><id>https://hit9.dev/post/quadtree</id><author><name></name></author><summary type="html"><![CDATA[本文是我实现四叉树 (quadtree) 的一个 C++ 库的开发笔记。]]></summary></entry><entry xml:lang="en"><title type="html">Thoughts, Optimizations, and C++ Implementation of Quadtrees</title><link href="https://hit9.dev/post/en/quadtree" rel="alternate" type="text/html" title="Thoughts, Optimizations, and C++ Implementation of Quadtrees" /><published>2024-08-04T00:00:00+08:00</published><updated>2024-08-04T00:00:00+08:00</updated><id>https://hit9.dev/post/en/quadtree</id><author><name></name></author><summary type="html"><![CDATA[This article documents my development notes on implementing a C++ library for quadtrees.]]></summary></entry><entry><title type="html">AABB 检测平面矩形重叠</title><link href="https://hit9.dev/post/aabb" rel="alternate" type="text/html" title="AABB 检测平面矩形重叠" /><published>2024-08-03T15:20:00+08:00</published><updated>2024-08-03T15:20:00+08:00</updated><id>https://hit9.dev/post/aabb</id><author><name></name></author><summary type="html"><![CDATA[关于 2D 平面上检测两个矩形是否重叠的一篇小短文。]]></summary></entry><entry><title type="html">分散层叠算法 Fractional Cascading</title><link href="https://hit9.dev/post/fractional-cascading" rel="alternate" type="text/html" title="分散层叠算法 Fractional Cascading" /><published>2024-06-24T17:44:00+08:00</published><updated>2024-06-24T17:44:00+08:00</updated><id>https://hit9.dev/post/fractional-cascading</id><author><name></name></author><summary type="html"><![CDATA[最近新学了一个有意思的冷门算法，主要解决多个有序序列上的在线查询问题。]]></summary></entry><entry xml:lang="en"><title type="html">Fractional Cascading</title><link href="https://hit9.dev/post/en/fractional-cascading" rel="alternate" type="text/html" title="Fractional Cascading" /><published>2024-06-24T17:44:00+08:00</published><updated>2024-06-24T17:44:00+08:00</updated><id>https://hit9.dev/post/en/fractional-cascading</id><author><name></name></author><summary type="html"><![CDATA[Recently, I learned an interesting and niche algorithm that primarily addresses online query problems on multiple sorted sequences.]]></summary></entry><entry><title type="html">系统设计中的经验之谈 💎</title><link href="https://hit9.dev/post/system-design" rel="alternate" type="text/html" title="系统设计中的经验之谈 💎" /><published>2024-06-13T10:00:00+08:00</published><updated>2024-06-13T10:00:00+08:00</updated><id>https://hit9.dev/post/system-design</id><author><name></name></author><summary type="html"><![CDATA[本文是我对系统设计的一些思路和方法，源于个人经验的一个整体性总结。]]></summary></entry><entry><title type="html">种一颗小小的行为树 - 开发笔记</title><link href="https://hit9.dev/post/behavior-tree" rel="alternate" type="text/html" title="种一颗小小的行为树 - 开发笔记" /><published>2024-05-05T16:47:00+08:00</published><updated>2024-05-05T16:47:00+08:00</updated><id>https://hit9.dev/post/behavior-tree</id><author><name></name></author><summary type="html"><![CDATA[本文是最近开发的一个简单的 C++ 行为树库 bt.cc 的开发笔记。]]></summary></entry><entry xml:lang="en"><title type="html">Planting a Tiny Behavior Tree - Development Notes</title><link href="https://hit9.dev/post/en/behavior-tree" rel="alternate" type="text/html" title="Planting a Tiny Behavior Tree - Development Notes" /><published>2024-05-05T16:47:00+08:00</published><updated>2024-05-05T16:47:00+08:00</updated><id>https://hit9.dev/post/en/behavior-tree</id><author><name></name></author><summary type="html"><![CDATA[This article is a development log for a simple C++ behavior tree library bt.cc that I recently developed.]]></summary></entry><entry><title type="html">一个数据和行为分离的下推自动机的开发笔记</title><link href="https://hit9.dev/post/pushdown-fsm" rel="alternate" type="text/html" title="一个数据和行为分离的下推自动机的开发笔记" /><published>2024-05-05T15:20:00+08:00</published><updated>2024-05-05T15:20:00+08:00</updated><id>https://hit9.dev/post/pushdown-fsm</id><author><name></name></author><summary type="html"><![CDATA[本文是最近写的一个简单的 C++ 下推自动机 pdfsm.h 的开发笔记。]]></summary></entry></feed>