Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
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
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Kleder
All | Freeware

Code 1-17 of 17   






ECEF2LLA - convert earth-centered earth-fixed (ECEF) cartesian coordinates to latitude, longitude, and altitude.

USAGE:
[lat,lon,alt] = ecef2lla(x,y,z)

lat = geodetic latitude (radians)
lon = longitude (radians)
alt = height above WGS84 ellipsoid (m)
x = ECEF X-coordinate (m)
y = ECEF Y-coordinate (m)
z = ECEF Z-coordinate (m)

Notes: This function assumes the WGS84 model. Latitude...



This function computes Spherical Error Probable radius from inputs consisting of the square roots of the eigenvalues of a covariance matrix (equivalently, from sigma-x, sigma-y, and sigma-z, of a trivariate normal distribution in a coordinate...



VERT2CON - convert a set of points to the set of inequality constraints which most tightly contain the points; i.e., create constraints to bound the convex hull of the given points

[A,b] = vert2con(V)

V = a set of points,...



This function uses the Vincenty direct algorithm to solve the "forward geodesic problem," which is the problem of computing the endpoint of a geodesic (shortest-distance) path on the ellipsoidal earth, given the start point, a path...



SATGLOBE4 - This file is a higher-resolution version of "SATGLOBE," provided at the request of several users. SATGLOBE4 renders a fully manipulatable satellite view of earth at a resolution of four pixels per degree, with added...



CON2VERT - convert a convex set of constraint inequalities into the set of vertices at the intersections of those inequalities;i.e., solve the "vertex enumeration" problem.

V = con2vert(A,b)

Converts the polytope...



SHPATH - shortest path with obstacle avoidance (ver 1.3)

Given a "terrain" matrix consisting of zeros (for open space) and ones (for obstacles), this function computes the shortest path between two specified points while...



QUADPROG2 - Convex Quadratic Programming Solver
Featuring the SOLVOPT freeware optimizer

New for version 1.1:
* Significant speed improvement
* Geometric Preconditioning
* Improved Error Checking

USAGE:



NOREDUND - Remove redundant linear inequalities from a set of inequalities; i.e., remove redundant linear constraints defining a feasible region. Note that the feasible region satisfies A*x <= b, where A is a fixed matrix, b is a fixed vector,...



SATGLOBE4e - Draws an idealized satellite view of earth scaled to match the WGS84 ellipsoid.

This file renders a fully manipulatable satellite view of earth at a resolution of four pixels per degree, with added international political...



SATGLOBE - This file renders a fully manipulatable satellite view of earth at a resolution of two pixels per degree, with added international political boundaries and gridlines. The imagery was obtained from NASA, and the globe was rendered using...



SHPATH - shortest path with obstacle avoidance (ver 1.3)

Given a "terrain" matrix consisting of zeros (for open space) and ones (for obstacles), this function computes the shortest path between two specified points while...



This function solves the "forward geodesic problem," which is to compute the endpoint of a geodesic (shortest-distance) path on the ellipsoidal earth, given the start point, a path length, and a starting azimuth.

In response...



This submission contains VERT2LCON and LCON2VERT, which will find the linear constraints defining a bounded polyhedron in R^n, given its vertices, or vice versa. They are extensions of Michael Kleder's VERT2CON and CON2VERT functions that can...



Recently, the folks at http://web.tickle.com sent out an advertisement where you have to assemble a cube in 3-D in your mind from a flat drawing, and then decide which of several drawn cubes match the truth.

I won't give the answer away...



(1) Use the mouse to click and drag the red data points within the dotted gray box, and observe the changes in the conic section in real time.
(2) This function requires the symbolic math toolbox and is tested using Matlab version 7.1 (R14)...



</b>In 1975, Vincenty published a rapidly converging algorithm for computing the distance between points on an ellipsoidal earth. The algorithm is precise to within a few millimeters. Since then, his algorithm has since seen significant...