polytri - Fast and simple polygon triangulation library.

  •        54

PolyTri is a polygon triangulator for simple polygons based on Seidel's algorithm [1]. PolyTri is released under the Unlicense.

https://github.com/tcoppex/polytri

Tags
Implementation
License
Platform

   




Related Projects

delaunator - A really fast JavaScript library for Delaunay triangulation of 2D points

  •    Javascript

A really fast JavaScript library for Delaunay triangulation of 2D points.Constructs a delaunay triangulation object given an array of points ([x, y] by default). getX and getY are optional functions of the form (point) => value for custom point formats. Duplicate points are skipped.

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

  •    Javascript

The fastest and smallest JavaScript polygon triangulation library. 2.5KB gzipped.The library implements a modified ear slicing algorithm, optimized by z-order curve hashing and extended to handle holes, twisted polygons, degeneracies and self-intersections in a way that doesn't guarantee correctness of triangulation, but attempts to always produce acceptable results for practical data.

Computational Geometry

  •    CSharp

A library of Computational Geometry algorithms such as convex hulls, Voronoi diagrams, line intersections, triangulations, and more; written in C#.

delaunay - Fast Delaunay Triangulation in JavaScript.

  •    Javascript

This is just a quick little implementation of Delaunay Triangulation in JavaScript. It was mostly ported from Paul Bourke's C implementation, but I referenced some bits from another JavaScript implementation and rewrote a bunch of things in ways more amenable to fast JavaScript execution. To the extent possible by law, I have waived all copyright and related or neighboring rights to this library.

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

  •    Javascript

A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms.


cgal - The public CGAL repository, see the README below

  •    C++

The Computational Geometry Algorithms Library (CGAL) is a C++ library that aims to provide easy access to efficient and reliable algorithms in computational geometry. The primary vector of distribution of CGAL are sources tarballs, released twice a year, announced on the web site of CGAL. The sources distributed that way can be built using the CGAL installation manual.

Wykobi Computational Geometry Library

  •    C++

Wykobi is an efficient, robust and simple to use multi-platform 2D/3D computational geometry library. Wykobi provides a concise, predictable, and deterministic interface for geometric primitives and complex geometric routines using and conforming to the ISO/IEC 14882:2003 C++ lan

supercluster - A crazy fast geospatial point clustering library for browsers and Node.

  •    Javascript

A very fast JavaScript library for geospatial point clustering for browsers and Node.Loads an array of GeoJSON Feature objects. Each feature's geometry must be a GeoJSON Point. Once loaded, index is immutable.

turf - A modular geospatial engine written in JavaScript

  •    Javascript

Turf is a JavaScript library for spatial analysis. It includes traditional spatial operations, helper functions for creating GeoJSON data, and data classification and statistics tools. Turf can be added to your website as a client-side plugin, or you can run Turf server-side with Node.js (see below).Download the minified file, and include it in a script tag. This will expose a global variable named turf.

toxiclibsjs - Toxiclibsjs is a library for computational design tasks with JavaScript

  •    Javascript

Toxiclibs.js is a port of Karsten Schmidt's Toxiclibs for Java and Processing. Toxiclibs.js provides powerful datatypes for the browser and node. It works well for manipulating any DOM element, including Canvas and SVG. The plethora of examples demonstrate its use for geometry and color manipulation as well as physics, automata and more. The examples pair with such fine libraries as: Processing.js, Three.js, D3.js or Raphael.js.

TriangulationDrawable - Low Ploy Triangulation Animation on Android.

  •    Java

The code of triangulation animation is ported from the SVG triangulation (JavaScript). Obtain an TriangulationDrawable with a bacground color parameter.

triangle - Convert images to computer generated art using delaunay triangulation.

  •    Go

Triangle is a tool to create image arts using the delaunay triangulation technique. It takes an image as input and it converts to abstract image composed of tiles of triangles. The library can be installed via Homebrew too or by downloading the binary file from the releases folder.

polypartition - Tiny Polygon Partitioning and Triangulation Library

  •    C++

PolyPartition is a lightweight C++ library for polygon partition and triangulation. PolyPartition implements multiple algorithms for both convex partitioning and triangulation. Different algorithms produce different quality of results (and their complexity varies accordingly). The implemented methods/algorithms with their advantages and disadvantages are outlined below. For input parameters and return values see method declarations in polypartition.h. All methods require that the input polygons are not self-intersecting, and are defined in the correct vertex order (conter-clockwise for non-holes, clockwise for holes). Polygon vertices can easily be ordered correctly by calling TPPLPoly::SetOrientation method.

QVision: Computer Vision Library for Qt

  •    C++

Computer vision and image processing library for Qt.

2Geom

  •    C++

lib2geom (2Geom in private life) is a library developed for inkscape to provide a robust computational geometry framework. It is not a rendering library, instead concentrating on high level algorithms such as computing arc length.

KamiWaAi

  •    

KamiWaAi is an interactive Java skecthing software for 3D geometry based on Geometric Algebra concept. It also provide computational layer or framework using coordinate free approach to those who want to build GA based application on top of it.

TeDi: test suite for distance transforms

  •    C

A test suite and benchmark for exact Euclidean distance transform algorithms used in Image Processing and computational geometry. It evaluates the exactness and speed of algorithms for a large number of test cases. Results can be visualized in Scilab.

Configurable Math Library

  •    C++

The CML (Configurable Math Library) is a free, open-source C++ vector, matrix, and quaternion math library designed for use in games, graphics, computational geometry, and related applications.

CGTutorial

  •    Java

CGTutorial is a computational geometry tutorial written in Java. It implements various CG algorithms and animates some of them. A library of CG methods and data structures is provided, in the form of Java packages.