Search
New Code
AnyGantt JS Gantt Charts 8.0.0
Hex Comparison 5.12
SecureBridge 8.1
Hotelline PMS 1.0
TeeBI for RAD Studio Suite 2017
AnyStock Stock and Financial JS Charts 8.0.0
Entrepreneur News Portal 1.0.2
Advanced MLM Software 1.2
JavaScript Pop-up Box - free scripts 1.0
wolfSSL 3.12.0
Bytescout PDF SDK 1.6.0.207
Fundraiser by NCrypted Websites 1.0
Bytescout PDF To HTML SDK 8.6.0.2911
iTech StockPhoto Script 2.03
AnyMap JS Maps 8.0.0
Top Code
Jango Clone Script 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Sine Wave Using JavaFX 1.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
Code Listing by Luigi Giaccari

Code 1-10 of 27   Pages: Go to  1  2  3  Next >>  page  






StructTetraMesh is a tool to build structured tetreaedral mesh on cuboid dataset. This is usefull in avoiding delaunay 3D triangulation that for this kind of dataset are particularly slow and numerically unstable.
This tool allows a huge speed improvement against delaunayn for 3D points, the output triangulation will also be d-deDUslivers-lessd-deDt, this is particularly important for programs that need a conform triangulation like



The native unique works using the sortrows algorithm which can be very slow for large models.

Sometimes we need to avoid passing multiple values to functions that do not support those.
In most of these cases we are pretty sure that...



</b>

This version has been developed for open surface.

Differently from crust based algorithm does not ensure a tight triangluation and sometimes self-intersecant triangles are generated, it is also generally slower....



In this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.

You want more? go to the Professional version of GLTree

It has been designed for uniformly...



SolverNxN is designed to solve many small linear system in a vectorized way in order to improve time perfomaces. It is in practice a faster alternative to the matlab commands:


<!--code1--><!--ecode1-->for k =...



A few days ago I was in need of uniformly random points generation on the surface of sphere. I suddenly discovered that common parametrization with 2 angles is useless, it gathers too many points in the poles. At MathWorld you can find the...



This is Brand new so please advise-me if problems occurs.

Here you can find an m-file with three different algorithms for inpolygon test.
Depending on the input data, the one that is extimate to be the best will be chosen.



You can find the description at:

http://www.advancedmcode.org/poker-predictor.html

A Matlab independent version can be found at:

http://www.advancedmcode.org/poker-predict...y-computer.html



Have you ever thought about the fastest way to sort N numbers?

Last week I wrote a post about the fastest way to sort 3 numbers, this week I show you a tricky way to optimize the sort of N numbers.

The problem of sorting an...



This submission is for Matlab beginners.

After I post my tools on surface recostruction I received many e-mails of people asking what is the best way to get a surface from 3D scatter.
Most of them (about 90%), show to me surfaces...