74 Open source projects that are alternatives of or similar to Wykobi

Computation of Midcurve of Thin Polygons using Neural Networks

Develop a 3D interactive graphics rendering engine

Object-oriented pure Python B-Spline and NURBS library

geometry processing and shape analysis framework

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

Qhull development for www.qhull.org -- Qhull 8.0.2 (2020.2 candidate) at https://github.com/qhull/qhull/wiki

A small (<10kb minified) javascript library for splitting polygons by a polyline.

A very fast static spatial index for 2D points and rectangles in JavaScript

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

Hootenanny conflates multiple maps into a single seamless map.

Processing Geometry Suite

A list of awesome open source projects Vladimir Agafonkin is involved in.

A fast static index for 2D points

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

Simple sweep line visibility polygon algorithm implementation

Community for parametric furniture designs.

A growing collection of interactive tutorials, demos, and quizzes about maths, algorithms, and programming.

2D and 3D computational geometry library

HGeometry

A musical interface based on symmetric 7-set Venn diagrams

Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75

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

A work in progress polygon operations library with integer snap-rounding

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)

Digital Geometry Tools and Algorithm Library

Open source library for scientific HPC

A really fast C++ library for Delaunay triangulation of 2D points

A modular geospatial engine written in JavaScript

LimberGridView, a powerful JavaScript Library using Computational Geometry to render movable, dynamically resizable, and auto-arranging grids. Written in vanilla JavaScript, it can be plugged into most frameworks, plus it has a plugin for React applications. It gives users the most optimal arrangements using its highly efficient and fine-tuned a…

Aesthetic Engine 2

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

Heightmap meshing utility.

Geometric operations on polytopes of any dimension

The fastest and smallest JavaScript polygon triangulation library for your WebGL apps

A simple and fast library for mesh booleans and more.

Martinez-Rueda polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor

Seidel's LP Algorithm: Linear-Complexity Linear Programming for Small-Dimensional Variables

Exact Computation Geometry Framework Based on 'CGAL'

The Tektosyne Library for Java provides algorithms for computational geometry and graph-based pathfinding, along with supporting mathematical utilities and specialized collections.

Computational Geometry Unity library with implementations of intersection algorithms, triangulations like delaunay, voronoi diagrams, polygon clipping, bezier curves, ear clipping, convex hulls, mesh simplification, etc

The C++ ELEMENTS library contains a suite of sub-libraries to support mathematical functions (elements), data representations (MATAR), and novel mesh classes (geometry and SWAGE) to support a very broad range of element types, numerical methods, and mesh connectivity data structures useful for computational physics and engineering.

An incredibly fast JavaScript library for Delaunay triangulation of 2D points

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

⟨Leibniz-Grassmann-Clifford⟩ differential geometric algebra / multivector simplicial complex

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

🔺 Fast and simple polygon triangulation library.

GeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles

Notebooks and libraries for spatial/geo Python explorations

C++ 2D geometry library, handles points, lines, polylines, planar transformations (and other primitives), using homogeneous coordinates. Provided with complete manual and samples.

A very fast geospatial point clustering library for browsers and Node.

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

Interactive, customizable street imagery viewer in the browser, powered by WebGL

The fastest spatial index for geographic locations in JavaScript

OBB implementation in python (using numpy)

A Julia package for calculus with convex sets

Automatic conservative mesh occluder generation by box filling

Very fast LineString simplification using RDP or Visvalingam-Whyatt and a Rust binary

A d-dimensional aabb-tree implementation for MATLAB.

Book list of computational geometry and computer graphics 计算几何和计算机图形学必读书单与经典书籍