bestinsert

Cancelled Posted Sep 13, 2007 Paid on delivery
Cancelled Paid on delivery

Program in lisp must run into AutoCAD Italian and English from 2000 2002 2003.. It cannot call external subroutine, windows of command (cmd), other programs exe, DLL owners, must totally be realized in lisp and to turn totally in the AutoCAD ambient, the program must consist in only one lsp file. The program must resolve onle the problem 2D in the flat XY. The program must have the visible code (lisp not compiled) and modifiable without the payment of ulterior royalties. The rights of I use and of modification they must be yielded for entire me that I will be able also to distribute it in free shape. It must be loaded as an example like a normal program lisp: (load “[url removed, login to view]?) Two similar but not identical elements block (blocks) of Autocad (a base and one new) must be overlapped. The customer trace of the lines of the points accredits of the two blocks that go from the new block to the block base. The program after that the customer has selected the two it blocks and selected the lines that join the points accredits, finds the best translation and the best spin of the new block for the superimposition of the two blocks. The program moves and wheel the new block of the data that it has previously calculated. The program in order to find the correct translation and spin must diminish the sum of the squares of the distances of the points accredits. The number of the points accredits is a variable one and can be from 2 to 100. Solution of calculation alternatives (Newton, etc….) to the place of the minimums squared over it mentions to you can be uses you from the coder but the solution obtained is better than the least-squares method better (that it diminishes better the sum of medium the refuse square to us).

## Deliverables

1) the program will be thought working and it will be passed to the payment after to have carried out 5 generic tests and it turns out to you are confronts to you with the found solution of the Resolver of Excel. 2) Example of operation Example with 4 points accredits, the program must work from 2 to 100 points accredits. The customer in AutoCAD open the block Base: [url removed, login to view] Inserts the New block: [url removed, login to view] The customer has hour in AutoCAD 2 blocks to places in the plan in points whichever (the blocks can be of whichever type) [url removed, login to view] The customer recalls the program (load “[url removed, login to view]?) executed from the coder: [url removed, login to view] The customer trace always from the New block to the block Base of the elements line that join the points accredits An-Ab; Bn-Bb; Cn-Cb; Dn-Db [url removed, login to view] The customer calls the program bestinsert, the program demands to select the New block, the customer the selection and from confirmation, the program asks the block Base, the customer the selection and from confirmation, the program asks the selection of the lines that join the points accredit (from 2 to 100 lines) and confirmation. The algorithm tries Dx, Dy and Theta to apply to the such New block for which it comes diminished the following sum: (XAn-XAb) ^2+ (YAn-YAb) ^2 + (XBn-XBb) ^2+ (YBn-YBb) ^2 + (XCn-XCb) ^2+ (YCn-YCb) ^2 + (XDn-XDb) ^2+ (YDn-YDb) ^2 + .......... (XNn-XNb) ^2+ (YNn-YNb) ^2 = Tot_Sum In short the assumed algorithm once Dx, Dy, Theta calculates the translation & rotating of the coordinates of the points accredits of the New block and of it it calculates the new position, it calculates the sum of the differences to the square on axis X and Y of each brace of points accredits; make new modification Dx, Dy and Theta end a lot that the Tot_sum sum becomes minimal and converges on a small number (not never cancels less than the objects they are not coinciding). The program must find the solution within 1 minute on a PC with 1000 Mhz Processor. Once found the solution the program moves and rotate of Dx, Dy, Theta the new block and finishes its function. [url removed, login to view] [url removed, login to view] Suggestion: in first approximation Dx and Dy they are given from the difference of the coordinates of the barycentres calculates to you on the group of points accredits on the New block and the block Base. Attached the file Excel used in order to find the better position of the New block.

## Platform

Program in lisp must run into AutoCAD Italian and English from 2000 2002 2003.. It cannot call external subroutine, windows of command (cmd), other programs exe, DLL owners, must totally be realized in lisp and to turn totally in the AutoCAD ambient, the program must consist in only one lsp file. The program must resolve onle the problem 2D in the flat XY. The program must have the visible code (lisp not compiled) and modifiable without the payment of ulterior royalties. The rights of I use and of modification they must be yielded for entire me that I will be able also to distribute it in free shape.

C Programming C# Programming CAD/CAM Engineering Geolocation Microsoft MySQL PHP Software Architecture Software Testing Windows Desktop

Project ID: #3292411

About the project

1 proposal Remote project Active Oct 5, 2007

1 freelancer is bidding on average $170 for this job

basilisk96

See private message.

$170 USD in 30 days
(15 Reviews)
3.9