6 个仓库
Algorithms and data structures for indexing and querying geographic information.
Distinguishing note: Focuses on geocoding and spatial partitioning.
Explore 6 awesome GitHub repositories matching data & databases · Spatial Data Structures. Refine with filters or upvote what's useful.
This project is a comprehensive educational resource focused on the principles, patterns, and trade-offs required to design scalable, reliable, and high-performance distributed systems. It provides a structured curriculum that covers the fundamental architectural strategies necessary for building modern software infrastructure, ranging from high-level system decomposition to low-level networking and data management. The repository distinguishes itself by offering deep dives into complex architectural patterns, such as microservices-based decomposition, event-driven communication, and command-
Explains geohashing and quadtrees for efficient spatial data representation.
Open3D is a software toolkit designed for the processing, alignment, and reconstruction of three-dimensional data. It functions as a computer vision geometry engine that enables the manipulation of point clouds, meshes, and volumetric grids derived from sensor inputs. The library distinguishes itself through a high-performance computational core that executes geometric processing tasks in native code, paired with a binding layer that exposes these capabilities to high-level languages for rapid prototyping. It provides specialized algorithms for spatial registration, allowing users to merge mu
Organizes 3D points using spatial indexing structures to facilitate efficient geometric processing.
The Point Cloud Library is a collection of C++ algorithms designed for filtering, registering, and analyzing large-scale 3D spatial datasets. It provides a framework for 3D point cloud processing, incorporating tools for spatial data filtering and geometric feature estimation. The library includes specialized systems for aligning multiple spatial datasets into a single unified coordinate system and a rendering engine for the visual inspection and analysis of processed point cloud data. It also features tools for calculating spatial descriptors to identify structural patterns and shapes within
Uses KD-tree spatial partitioning to enable fast nearest-neighbor searches and spatial queries within point clouds.
CGAL is a software library that provides a comprehensive collection of computational geometry algorithms and data structures. It is built around a geometry kernel that defines fundamental geometric primitives and operations, enabling the construction of complex geometric objects and the computation of geometric predicates with exact arithmetic for reliable results. The library covers a wide range of geometric computation capabilities, including the construction of convex hulls, triangulations of point sets, and the generation of Voronoi diagrams. It also supports the processing of polygonal m
Constructs complex spatial data structures like triangulations, arrangements, and meshes.
FAST_LIO 是一个实时 SLAM 系统和激光雷达惯性里程计包,专为同步定位与建图而设计。它作为状态估计引擎和 3D 建图工具,将激光雷达点云与惯性测量单元(IMU)数据融合,以提供稳健的机器人状态估计。 该系统利用紧耦合传感器融合方法和迭代卡尔曼滤波器来估计位置和方向。它通过直接点对面匹配脱颖而出,该匹配通过将原始激光雷达点与地图表面匹配来计算里程计,而无需手动提取几何特征。为了保持高处理速度,它采用了增量 KD 树建图和并行空间搜索树。 该框架涵盖了广泛的功能,包括用于校正空间畸变的运动去畸变和传感器时间戳同步。它还提供了用于传感器外参标定、传感器对齐初始化以及累积全局点云导出的实用程序。 该项目使用 C++ 实现,并提供用于集成外部 IMU 和激光雷达传感器数据流的接口。
Utilizes incremental KD-trees to optimize nearest-neighbor searches and point insertion during real-time mapping.
pyslam is a framework for Simultaneous Localization and Mapping that combines Python flexibility with C++ performance. It is a sparse SLAM implementation designed to map environment geometry and track device location by processing image frames into 3D points. The project features a bridge for exposing high-performance C++ classes to Python scripts using zero-copy memory sharing. This integration allows for switching between a scripting interface for rapid prototyping and a compiled core for execution speed. The system includes a spatial map optimizer to refine 3D point and camera pose estima
Uses k-d trees to efficiently organize 3D points and accelerate nearest-neighbor searches for spatial matching.