The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
-
Updated
Jul 19, 2021 - Java
The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.
Build, edit and analyse edge-to-edge tessellations of unit-side polygons in Scala 3, on top of a Doubly Connected Edge List (DCEL).
Implementations for various point location algorithms on planar subdivisions
This repository contains the implementation of the Kirkpatrick Point Location algorithm for efficient point location in planar subdivisions. It includes code for constructing the data structure and performing point location queries.
基于 DCEL 半边结构的平面细分:从任意二维曲线集合提取最小面域与最大面域。拓扑核心零 CAD 依赖,Revit 仅为适配器。配 58 个不变量测试。
To associate your repository with the planar-subdivision topic, visit your repo's landing page and select "manage topics."