Displaying 1 to 20 from 30 results

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.

flubber - Tools for smoother shape animations.

  •    Javascript

Some best-guess methods for smoothly interpolating between 2-D shapes. Let's say you want to animate between two SVG paths or canvas shapes in a visualization. If you plug in their coordinates or their path strings to something like d3.transition(), it might work if the shapes correspond to each other really well - for example, turning a triangle into a different triangle. But once your shapes don't really correspond, you'll get unpredictable results with weird inversions and sudden jumps.

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.

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.




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.

tin-terrain - A command-line tool for converting heightmaps in GeoTIFF format into tiled optimized meshes

  •    C++

TIN Terrain is a command-line tool for converting heightmaps presented in GeoTIFF format into tiled optimized meshes (Triangulated Irregular Network) with different levels of details. Check out heremaps/quantized-mesh-viewer for examples of rendering output in Cesium.js and Three.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.

LibTessDotNet - C# port of the famous GLU Tessellator - prebuilt binaries now available in "releases" tab

  •    CSharp

Provide a robust and fast tessellator (polygons with N vertices in the output) for .NET, also does triangulation.SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008) More information in LICENSE.txt.


delaunify - randomly delaunay-triangulates an image

  •    Javascript

Randomly delaunay-triangulates an image by distributing 2D points across the surface, and then triangulating it. The colours of each triangle is determined by the pixel color underneath the triangle's centroid.A new canvas is returned with the same size as the image.

triangulate-contours - triangulates a series of 2D contours

  •    Javascript

Triangulates a series of contours using Tess2.js. Returns a simplicial complex with { positions, cells }. Works with 2D and 3D coordinates, and contours can be in reverse winding order for holes.positions are a series of points with the same number of components as the input, and cells is a list of faces with indices into the positions array.

LocationWithoutPrompt - A proof of concept to show how easy it is to get coarse location of the user without using Core Location

  •    Swift

The code is licensed under GPL. Yep, you guessed it. I pretty much don't want anyone to use this. This is a proof of concept code. I'm not sure if this is a serious security/privacy hole. Apple can only prevent developers from getting the Mac Address of the phone and not that of the connected router, though I'm not sure on this.

cordova-plugin-advanced-geolocation - Highly configurable native Android interface to both GPS and NETWORK on-device location providers

  •    Java

Highly configurable native interface to GPS and NETWORK on-device location providers. It will return and identify any location data registered by the on-device providers including real-time satellite info. It also offers direct access to CellInfo, CellLocation and CellSignalStrength data.

triangulate-image - Image Triangulation

  •    Javascript

Simple Web App that tries to turn an image into a triangulated mosaic. Check this link for example results. Click Here to see a live demo.

qhull-js - JavaScript port of qhull

  •    Javascript

A JavaScript port of qhull. This function computes the n-dimensional convex hull of a collection of points.

omega_h - Simplex mesh adaptivity for HPC

  •    C++

Omega_h is a C++11 library that implements tetrahedron and triangle mesh adaptativity, with a focus on scalable HPC performance using (optionally) MPI, OpenMP, or CUDA. It is intended to provided adaptive functionality to existing simulation codes. Mesh adaptivity allows one to minimize both discretization error and number of degrees of freedom live during the simulation, as well as enabling moving object and evolving geometry simulations. Omega_h will do this for you in a way that is fast, memory-efficient, and portable across many different architectures. For a bare minimum setup with no parallelism, you just need CMake, a C++11 compiler, and preferably ZLib installed.

CDT-plusplus - Causal Dynamical Triangulations in C++ using CGAL

  •    C++

Quantize spacetime on your laptop. For an introduction to Causal Dynamical Triangulations, including the foundations and recent results, please see the wiki.

shape2d-triangulate - triangulates a list of shape2d polygons

  •    Javascript

Takes a single Shape or a list of Shapes (from shape2d) and triangulates them using poly2tri. It attempts to sanitize input, removing collinear points, equal points, etc so that it works with poly2tri. It also allows for a basic list of steiner points to be included as the second parameter; they will be ignored if they are outside of the polygon's contour. If winding orders differ from the first specified Shape, they are assumed to be holes. Otherwise, subsequent Shape objects are assumed to be a completely new shape that need their own triangulation and sweep context. Each shape is assumed to be its own closed polygon (i.e. will likely break if one Shape has many moveTo's to create disconnected polygons).

polytri - Fast and simple polygon triangulation library.

  •    C++

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

triangle-app - Desktop application for Triangle.

  •    Javascript

Triangle is the desktop application of https://github.com/esimov/triangle built on top of electron. It communicates with a backend server written in Go. For this reason you have to make sure Go is installed. After instalation set your GOPATH, and make sure $GOPATH/bin is on your PATH.






We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.