Search Results for "delaunay"
Sort By:
Showing 22 open source projects for "delaunay"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
CDT
Constrained Delaunay Triangulation (C++)
CDT is a C++ library for generating constraints or conforming Delaunay triangulations. -
2
Blender GIS
Blender addons to make the bridge between Blender and geographic data
...Display dynamics web maps inside Blender 3d view, requests for OpenStreetMap data (buildings, roads, etc.), get true elevation data from the NASA SRTM mission. Manage georeferencing information of a scene, compute a terrain mesh by Delaunay triangulation, drop objects on a terrain mesh, make terrain analysis using shader nodes, set up new cameras from geotagged photos, set up a camera to render with Blender a new georeferenced raster. -
3
Delaunator
Fast JavaScript library for Delaunay triangulation of 2D points
Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. -
4
PCGExtendedToolkit
PCGEx is a free (libre) Unreal 5 plugin that expands PCG capabilities. It offers a variety of high-performance nodes; with an edge for building relational graphs (Freeform, Delaunay, Voronoi, MST etc), advanced pathfinding; graph theory and much more.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
5
FractalImageCompression
Java Fractal Image Compression based on Delaunay triangulation
Implementation of the algorithm of the paper: "Fractal image compression based on Delaunay triangulation and vector quantization" It is a Fractal compression algorithm, based on relationships between regions of the image (in this case triangles), rather than in explicitly the pixel values themselves. Video demo: https://frojasg1.com:8443/resource_counter/resourceCounter?operation=countAndForward&url=https%3A%2F%2Ffrojasg1.com%2Fdemos%2Faplicaciones%2FfractalCompressor%2Ffractal_image_compression_v1.0_demo.mp4%3Forigin%3Dsourceforge&origin=web -
6
Netgen Mesh Generator
NETGEN is an automatic 3d tetrahedral mesh generator
NETGEN is an automatic 3d tetrahedral mesh generator. It accepts input from constructive solid geometry (CSG) or boundary representation (BRep) from STL file format. The connection to a geometry kernel allows the handling of IGES and STEP files. NETGEN contains modules for mesh optimization and hierarchical mesh refinement. Netgen is open source based on the LGPL license. It is available for Unix/Linux and Windows. -
7
PyMesh
Geometry processing library for Python
PyMesh is a codebase developed by Qingnan Zhou for his PhD research at New York University. It is a rapid prototyping platform focused on geometry processing. PyMesh is written with both C++ and Python, where computational intensive functionalities are realized in C++, and Python is used for creating minimalistic and easy-to-use interfaces. PyMesh is a rapid prototyping platform focused on geometry processing. It provides a set of common mesh processing functionalities and interfaces with a... -
8
FESolver
tiny finite elements solver based on triangles elements
Project contains: * delaunay - grid builder based on 2D-Delaunay algorithm (build triangles surface layer) * SLAU solver based on Gauss algorithm * solver - SDI application for evaluation T for nodes 3-angles 2D grid -
9
jdt4fpc
fpc port of jdt library
fpc port of Java Delaunay Triangulation library http://jdt.sourceforge.net/ -
Powerful App Monitoring Without Surprise BillsTired of monitoring tools that punish you for scaling? AppSignal offers transparent, predictable pricing with every feature unlocked on every plan. Track errors, monitor performance, detect anomalies, and manage logs across Ruby, Python, Node.js, and more. Trusted by developers since 2012 with free dev-to-dev support. No credit card required to start your 30-day trial.
-
10
-
11
TesselSphere
Spherical subdivision utility for MS Windows and Linux
TesselSphere is an OpenGL spherical subdivision utility for MS Windows and Linux. It currently employs particle and geodesic tesselators. The UI uses QHull morphers that split Delaunay and Voronoi hulls to create new cells in the lattice. Additionally, morphers can target individual cells to split or stellate. TesselSphere can be used to generate vertices for geodesic domes, pollen, radiolaria, viruses and other polyhedra. Comes with full documentation and source. Saves VRML 1.0, POV-Ray inc file and OBJ. ... -
12
CFD2D
The incompressible Navier-Stokes equations solver in 2D domains
CFD2D is open source software for Linux for solving the non-dimensionalized incompressible Navier-Stokes equations (NSE) inside an arbitrary two-dimensional domain inscribed in a unit square with Dirichlet and "do-nothing" boundary conditions. The space discretization is based on Finite Element Method (FEM) using an approximately uniform triangular mesh. The two choices of FE spaces are offered, these are of the so called MINI-element and of the Taylor-Hood element. The first element... -
13
as3delaunay
Delaunay triangulation and Voronoi diagram for Flash Builder 4 project
as3delaunay is an ActionScript 3 library that provides an implementation of Delaunay triangulation and Voronoi diagram generation. It is based on the well-known work of Raymond Hill and offers developers an efficient way to create and manipulate geometric structures for use in Flash and other AS3-based environments. The library enables users to generate Voronoi diagrams from a set of input points, allowing applications such as procedural map generation, image segmentation, and spatial partitioning. ... -
14
connect3d
Reconstruct Water-Tight Triangulation from Point Cloud
...It approximates the triangle mesh which minimizes the sum of all triangles' longest edge. As a result, it can interpolate much more sparse sampling as state-of-the-art algorithms. Run-time is in practice linear to that of the Delaunay triangulation of the points. The software is designed as a command-line tool. It can also be used as a library. A plug-in for the Meshlab geometry software is available as well. -
15
Parallel SCVT generator, using a new method for the parallel computation of Spherical Delaunay Triangulations. Uses Jonathan Shewchuk's Triangle http://www.cs.cmu.edu/~quake/triangle.html
-
16
This project is about the implementation of algorithms studied during mathematics and computer graphic courses for my MS's last year ( Point cloud approximation, Hermitian interpolation, Bezier / B-Spline Curves, Convex Hull, Delaunay triangulation
-
17
-
18
This project intends to implement sliver removing algorithms inside a 3D Delaunay mesh generator called TetGen. The algorithms are based on two techniques called Sliver Exudation and WQMesh.
-
19
Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.
-
20
GTS provides a set of useful functions to deal with 3D surfaces meshed with interconnected triangles including collision detection, multiresolution models, constrained Delaunay triangulations and robust set operations (union, intersection, differences).
-
21
An automatic 2D Delaunay mesh generator and solver for Finite Element Analysis. Can solve 2D field problems (Poisson and Helmholtz Equations). Can use LAPACK/ARPACK solvers producing OpenGL/Postscript output. Uses C/GTK/GTKGLExt/MFC. Runs on Win32/Unix.
-
22
Two dimensional (2D) fine mesh finite element (FE) grid editing system. Includes constrained Delaunay triangulation, and automated grid resolution changes based on local attributes. Win32 and Motif GUIs. Mature application, now going open source.
- Previous
- You're on page 1
- Next
