Search Results for "triangulation"
Sort By:
Showing 16 open source projects for "triangulation"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
CGAL
The Computational Geometry Algorithms Library
CGAL or the Computational Geometry Algorithms Library is a C++ library that gives you easy access to a myriad of efficient and reliable geometric algorithms. These algorithms are useful in a wide range of applications, including computer aided design, robotics, molecular biology, medical imaging, geographic information systems and more. CGAL features a great range of data structures and algorithms, including Voronoi diagrams, cell complexes and polyhedra, triangulations, arrangements of... -
2
SAGA - System for Automated Geoscientific Analyses - is a Geographic Information System (GIS) software with immense capabilities for geodata processing and analysis. SAGA is programmed in the object oriented C++ language and supports the implementation of new functions with a very effective Application Programming Interface (API). Functions are organised as modules in framework independent Module Libraries and can be accessed via SAGA’s Graphical User Interface (GUI) or various scripting...
-
3
headsort
headsort: streaming sort + 2x faster than gnu sort
...Best case was about opposite that of sort(1)*. NEW* hsort main algorithm speed improvement (applies to all; 27,29,31). Now faster than sort(1) (in all cases tested). Using triangulation, hsort begins piped sorted output when 1st bin is done. This means it has new applications in distributed computing and in some cases makes dc un-necessary. (gnu sort must finish all bins) Well compatible with gnu sort (not perfect). other algorthms featured if menu used: bubble, selection, insertion, shell, distributive counting, straight radix, radix exchange, quick, merge. ... -
4
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... -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
5
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. ... -
6
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. -
7
XFEM
XFEM implementation in MATLAB
The extended finite element method (XFEM) classified, one of the partition of unity method (PUM), allows discontinuities to be simulated independently of the mesh. This is possible by adding appropriate functions to the FE approximation basis, for example, the Heaviside function. The discontinuities can evolve in time, without a need for a conforming mesh. A MATLAB implementation of the XFEM written by VP Nguyen, is given here. The interaction of cracks and crack-inclusion interaction is... -
8
3D tracking using wiimote
3D tracking of 4 IR LEDs using 2 wiimotes and python
...The control is done via tele-manipulation which is done by the tracking of 4 IR LEDs fixed at the joints of the controller arm. This code is the part of the project responsible for the interfacing with the wiimote, stereo-triangulation of the wiimote data and determining the 3D coordinates of the IR LEDs. -
9
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
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
The Triangulator is a simple application that lets users perform the office work involved in the surveying task of triangulation. The Triangulator aims to perform the adjustment tasks in a triangulation figure after field work.
-
11
-
12
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.
-
13
DAPTA (Distributed AdaPtive Triangulation Algorithms) is a software library which contains data structures and algorithms for triangulations (meshes) for specific use in a parallel environment where mesh adaptation is required.
-
14
A C++ library of high level motion analysis/computer vision functions, coupled with GUIs that allow easy configuration and use. Current development focuses on color tracking, multiple camera calibration and triangulation, and 3D tracking algorithms.
-
15
The SurfaceBuilder turns a collection of programs for implicity surface triangulation. It is usefull for any high school math student.
-
16
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