Make your application to provide dxf import, export and viewing! The CADSoftTools components are a set of VCL components and classes for importing, exporting, viewing dxf files and a viewer of TGraphic descendants. Converters: Plug-and-play tools for import / export dxf to / from any cad application. VCL for Delphi /C++ Builder developers. The product has got TOpenPictureDialog with dxf preview.Provided: emf2dxf, wmf2dxf, dxf2bmp, dxf2emf,...
Need CAD - DXF Export? DXF Exporter allows programmers to create DXF files as easy as possible. All you need is to draw image using Windows GDI functions onto DXF Exporterls DC or make a metafile and give it to the Exporter. DXF Exporter reads...
DXF Import .NET is an easy-to-use API for reading AutoCAD DXF in C# and VB.NET applications. It is completely programmed in C# and supports the following entities: 3dFace, Arc, Attdef, Block, BlockRecord, Circle, Dimension, Ellipse, Insert, Layer,...
DXF VCL tools for Borland Delphi and C++Builder developers. TGraphic descendants for every format. TGraphic viewer provided. DCU or Delphi source code. Fast DXF reader. High quality: hatches, splines, viewports.Royalty free licensing.
This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.
This is a pure Python implementation of the rsync algorithm. On my desktop (3.0GHz dual core, 7200RPM), best case throughput for target file hash generation and delta generation is around 2.9MB/s. Absolute worst case scenario (no blocks in common)...
A-star (A*) Shortest Path Algorithm
Dijkstra shortest path algorithm.
Floyd-Steinberg dithering is an image dithering algorithm (see http://en.wikipedia.org/wiki/Floyd-Steinberg for more details). While the algorithm is mainly for image manipulation, I use it to create random locations for sensor networt devices.
This is a simple implementation of the famous LZW algorithm.
this algorithm predicts the received signal strength for the mobile user to avoid fluctuation in received signal strength during localization of the mobile user(finding mobile user's location)
NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems,...
Gravitational search algorithm (GSA) is an optimization algorithm based on the law of gravity and mass interactions.This algorithm is based on the Newtonian gravity: "Every particle in the universe attracts every other particle with a force...
The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm....
A flexible implementation of PSO algorithm with time-varying parameters. Algorithm is suitable for solving continuous optimization problems. Special care has been taken to enable flexibility of the algorthm with respect to its parameters and to...
findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS). An independent set of a graph is a subset of vertices in which no two vertices are adjacent. Given a set of vertices, the maximum independent set...
We use the genetic algorithm (gatool) to determine the four parameters of the implicit Forst-Kalkwarf-Thodos Model. Predictions are in perfect agreement with data of vapour pressure of iodobenzene versus temperature for a temperature range from...
This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). The new version (V2.2)is about 1.5 times faster than the old version (V2.1). It can solve a 1000 x 1000 problem in about 20 seconds in a...
This algorithm will accept a Latitude, Longitude and Altitude location as well as a specific universal coordinated time. It will use this information and calculate the position of the moon in a local coordinate frame (az and alt aka az and el).
This algorithm deal with multimodal optimization problems under constraints. |