369 Open source projects that are alternatives of or similar to tektosyne

google maps for block game

Delaunay Triangulation

A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes

A fast 'point(s)-in-polygon' test for MATLAB.

🏝: Voronoi Island

Unity client navmesh export to server for pathfinding

Open-source C++ library for geometry and linear algebra

A collection of classical algorithms and data-structures implementation in C++ for coding interview and competitive programming

A point in polygon library based on the paper "Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons" by Hao

A* search algorithm in TypeScript

Library for functional graph & geometry algorithms

A visualizer for pathfinding algorithms in 3D with maze generation, first-person view and device camera input.

A simple Delaunay 2D triangulation in python (with numpy)

R package polyclip: a port of the Clipper library for polygon geometry

A* algorithms for 2D gridmaps. The fastest one, until you prove me wrong

Processing Geometry Suite

Open source routing engine for OpenStreetMap. Use it as Java library or standalone web server.

a path find for tilebase game in unity

The public CGAL repository, see the README below

Implementation of Near-Optimal Hierarchical Pathfinding (HPA*) algorithm in Unity, tested with maps from Dragon Age: Origins

An experimental set of pathfinding algorithms for video games

An asynchronous A* pathfinding API written in Javascript.

Find paths in Unity Tilemaps with A* Search

Delaunay triangulations, Voronoi, convex hull and more. Ported to Haxe 3 from https://github.com/sledorze/hxDelaunay (itself a port of the excellent https://github.com/nodename/as3delaunay)

Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.

GPU Voronoi noise in Unity

A C++ implementation of the Fortune's algorithm for Voronoi diagram construction

Delaunay and Constrained Delaunay Triangulations in Java, providing high-performance utilities for modeling surfaces with support for Lidar LAS files, Digital Elevation Models (DEM), finite element analysis, path planning, natural neighbor interpolation, and other applications of Triangulated Irregular Networks (TIN)

A pmmp virion (library) for pathfinding using A*

Created in Unity 5 for the purposes of learning AI techniques. Features behaviour trees and A* pathfinding.

A simple simulation in Unity, which uses genetic algorithm to optimize forces applied to cubes

PythonFinder: Cross Platform Search Tool for Finding Pythons

AAAI 2020 - ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations

A library providing FFI access to fast Ramer–Douglas–Peucker and Visvalingam-Whyatt line simplification algorithms

fCoSE: a fast Compound Spring Embedder

Cross-platform grid-based UI and game framework.

A musical interface based on symmetric 7-set Venn diagrams

No longer being supported or maintained. A Graph Theory & Data Structure Library for JavaScript.

A Geometry library for Elixir that calculates spatial relationships between two geometries

C++ code for triangulating Point Cloud data and displaying it

Codebase for educational tool on algorithms

No description or website provided.

ROS package of A star algorithm

MATLAB bindings for JIGSAW: a Delaunay-based unstructured mesh generator.

We here are very big fans of NetworkX as a graph library and its comprehensive set of graph algorithms. For many though, working with NetworkX involves a steep learning curve. This guide is designed as an aid for beginners and experienced users to find specific tips and explore the world of complex networks.

Best practices for implementing A* with a focus on four- and eight-connected grid worlds.

A very fast visualization library for large, high-dimensional data sets.

simple Java implementation of Bentley-Ottmann sweep line algorithm for listing all intersections in a set of line segments

An implementation and presentation of selected mesh generation algorithms

A comprehensive library of algorithms for creating perfect mazes.

GARDENIA: Graph Analytics Repository for Designing Efficient Next-generation Accelerators

A* graph pathfinding in pure Elixir

Mirrored implementations of polygon clipping/CSG/operations algorithm, in C (original, by Martínez et al) and ActionScript3 (port, by Mahir Iqbal)

A C++ Library for Influence Maximization

Detect Hand and count number of fingers using Convex Hull algorithm in OpenCV lib in Python

A library to learn Algorithms and Data Structures for newbies

An easy to use GraphQL API to query country-related data for free and without restrictions

Install dependency graphs of Kubernetes Helm Charts

A library for graph analysis written Julia.

Master repository for the JGraphT project