Search Results for "step/iges/brep"
Sort By:
Showing 17 open source projects for "step/iges/brep"
View related business solutions-
With the world of work changed forever, it’s essential to manage your workplace and assets together to effectively create a high-performing environment. The Eptura experience combines the power of workplace management software with asset management, enabling you to effectively operate your building and facilitate hybrid work.
-
Chat with your business data with Looker. More than just a modern business intelligence platform, you can turn to Looker for self-service or governed BI, build your own custom applications with trusted metrics, or even bring Looker modeling to your existing BI environment.
-
1
Gap.app
Gap.app is a frontend and distribution for GAP on macOS
A native Macintosh front-end and distribution for the GAP computer algebra system. It provides a Mac-like command editing environment and save/load, while making available graphical libraries compatible with xgap. -
2
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. -
3
mssolutions
Makes magic squares.
.... For successful solutions, CompleteSquareSteps shows the steps of the search. The number exchanges at each step and the intermediate squares are written to files. MagicSquares does not require an input file. MagicSquares (only) also supports concentric and pandiagonal. (Pandiagonal succeeds only for small orders.) See: http://budshaw.ca/Download.html#complete http://budshaw.ca/Download.html#magics http://budshaw.ca/addenda/downloadNotes.html#completenotes -
4
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF... -
BrightGauge, a ConnectWise solution, was started in 2011 to fill a missing need in the small-to-medium IT Services industry: a better way to manage data and provide the value of work to clients. BrightGauge Software allows you to display all of your important business metrics in one place through the use of gauges, dashboards, and client reports. Used by more than 1,800 companies worldwide, BrightGauge integrates with popular business solutions on the market, like ConnectWise, Continuum, Webroot, QuickBooks, Datto, IT Glue, Zendesk, Harvest, Smileback, and so many more. Dig deeper into your data by adding, subtracting, multiplying, and dividing one metric against another. BrightGauge automatically computes these formulas for you. Want to show your prospects how quick you are to respond to tickets? Show off your data with embeddable gauges on public sites.
-
5
Pi-Trav
An interactive pi walk.
A simulation and visualization of random walks based on the digits pi. This program also has a settings menu. -
6
Advanced Numerical Instruments 3D
Advanced numerical instruments: adaptive meshing, FE methods, solvers
Ani3D provides portable libraries for each step in the numerical solution of systems of PDEs with variable tensorial coefficients: (1) unstructured adaptive mesh generation, (2) metric-based mesh adaptation, (3) finite element discretization and interpolation, (4) algebraic solvers. -
7
n-chinese-remainders
chinese remainder theorem - progressive solving, n-soln, extras
"chinese remainder" solves a system of equations over modulus quickly. crtwo is an improvement to Mathematica's release. crtwo: solves Chinese Remainder a pair at a time, (uses gcd), yet is still fast. Which means crtwo, unlike text book soln, uses an algorithm to solve or fail one mod equation at a time. showing win or fail of each eqn and solving other sawtooth intersections is possible, due to that. crAll2@crtwo provides n soln near x for CR using width of soln crchart3... -
8
LGS-Helfer
Ein Programm für die analytische Geometrie
Ein Programm zur schrittweisen Bestimmung der Lage von Punkten, Geraden und Ebenen. A german program for school mathematics: It helps you to calculate common points of planes and lines. It works step-by-step so you can find your mistakes easily. -
9
RIPE (Regulatory network Inference from joint Perturbation and Expression data) is a novel three-step method that integrates both perturbation data and steady state gene expression data in order to estimate a regulatory network. The ripe package is written in R, with additional functionality provided by a MATLAB executable file. The executable file uses a runtime engine called the MATLAB Compiler Runtime (MCR). The executable for different architectures is distributed on this site together...
-
Managing your therapy and rehab practice is a time-consuming process. You spend hours on paperwork, billing, scheduling, and more. Raintree’s Therapy & Rehab EHR is here to help you manage your practice more efficiently. With our all-in-one solution, you’ll get the tools you need to streamline your therapy and rehab practice, improve patient care, and get back to doing what you love.
-
10
Triangulator
Simple example for triangulate polygon with allegro engine (C++)
Simple example for triangulate polygon with allegro engine (C++). This project provided "as is". It have two bugs: cursor and camera orientation. If you do not pay attention to it, the program is working. Maybe I'll fix it later. -
11
fvm2
FVM2 - F Virtual Machine v2
FVM2 is VM for running machines like Markov algorithms, Turing machine and so on. FVM2 has debugger with step mode and breakpoints. Goal of this project is to help students with studying Theory of computation. FVM2 shows how complex code works within a real machine. Currently the only implemented machine is Markov algorithms. -
12
MCPerm: Monte Carlo SNP permutation
Monte Carlo permutation method for SNP multiple test correlation
..., especially for genome-wide association study (GWAS). To improve the calculation speed without changing the size of the TradPerm p-value, we developed a Monte Carlo permutation (MCPerm) method as an efficient alternative to TradPerm. Methods: MCPerm does not need to shuffle the original genotypes and phenotypes data. It uses Monte Carlo method, employs two-step hypergeometric distribution to generate the random number of genotypes (AA, Aa and aa) in cases and controls. -
13
Simplex-in-PHP are PHP scripts that solve small linear programming and integer linear programming problems executing the simplex method step by step, printing the tableau and drawing the graphical analysis. Useful for students in Operational Research
-
14
Adaptive Wavelet Applications on general domains - the goal still far away. But the first step is done. This project aims at introducing wavelet methods realized in C++. As building block it uses FLENS.
-
15
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
-
16
This is an electrochemical battery model designed to run on the Playstation 3. The model is solved using a direct banded solver at each Newton step.
-
17
A tool for proof theorists to study deduction systems and to develop proof search strategies for them. GraPE should eventually support step-by-step proof construction, automatic proof search with various strategies, proof transformations and analysis.
- Previous
- You're on page 1
- Next