# Software Downloads for "Hull Convex"

**ConvexHull**- License: Freeware

ConvexHull is a lightweight command line application that can draw the **convex** **hull** of any input image.

In order to use it, you simply have to specify the input file location and choose the output name and destination. The application features a line drawing algorithm that enables it to draw the **convex** **hull** and save the result to your computer.

.

**Platform:**Windows**Publisher:**Evgeny Pokhilko**Date:**

**FAST CONVEX HULL ALGORITHM**- License: Freeware

Even if totally m-coded, this routine is particularly fast in computing **convex** **hull** of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the call to unique function which can be very slow for large models .
Algorithm is very simple, it's based on cross product.
It is brand new, so please let me know if something goes wrong!
Since I received comments about different timings this version includes a speed test to compare ConvHull2D to the native matlab convhull.

**Platform:**Matlab, Scripts**Publisher:**Luigi Giaccari**Date:**26-06-2013**Size:**10 KB

**Rock generator**- License: Freeware

This program creates 3-dimensional rocks comprised of triangles by taking the **convex** **hull** of a sphere distorted with Perlin noise.
It outputs these rocks in OpenGL code. It requires the free CGAL library from http://www.cgal.org/ to compile..

**Platform:**C and C plus plus, Scripts**Publisher:**Mike Carson**Date:**23-02-2013**Size:**10 KB

**Lava rock**- License: Freeware

This program displays 3-dimensional rocks that were made by taking the **convex** **hull** of a sphere distorted with Perlin noise. These rocks are also texture-mapped with Perlin noise..

**Platform:**C and C plus plus, Scripts**Publisher:**Mike Carson**Date:**01-06-2013**Size:**31 KB

**quadprog2 - convex QP solver**- License: Freeware

QUADPROG2 - **Convex** Quadratic Programming Solver
Featuring the SOLVOPT freeware optimizer
New for version 1.1:
* Significant speed improvement
* Geometric Preconditioning
* Improved Error Checking
USAGE:
[x,v] = quadprog2(H,f,A,b)
[x,v] = quadprog2(H,f,A,b,guess)
[x,v,opt] = ...
Minimizes the function v = 0.5*x'*H*x + f*x
subject to the constraint A*x <= b.
Initial guess is optional.
("opt" returns SOLVOPT data for advanced use. Details are available in
the SOLVOPT documentation at the website identified below.

**Platform:**Matlab, Scripts**Publisher:**Michael Kleder**Date:**17-06-2013**Size:**31 KB

**VERT2CON - vertices to constraints**- License: Freeware

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, each ROW of which is one point
A,b = a set of constraints such that A*x <= b defines the region of space enclosing the **convex** **hull** of the given points
For n dimensions:
V = p x n matrix (p vertices, n dimensions)
A = m x n matrix (m constraints, n dimensions)
b = m x 1 vector (m constraints)
NOTES:
(1) In higher dimensions, redundant constraints can appear.

**Platform:**Matlab, Scripts**Publisher:**Michael Kleder**Date:**23-01-2013**Size:**10 KB

**scatterquad2**- License: Shareware

scatterquad2(X,Y,Z) finds the volume under the surface defined by the points (X(i),Y(i),Z(i)) with linear interpolation on the Delaunay triangulation of (X,Y) and Z=0 outside the **convex** **hull** of (X,Y).
Example:
load seamount
scatterquad2(x,y,z-min(z)) % returns 190.7996
inR = (x>=211.1 & x<=211.4 & y>=-48.35 & y<=-48);
scatterquad2(x,y,(z-min(z)).*inR) % returns 142.3083
scatterquad2(x,y,1) % returns 0.2696
This function is *much* faster than using DBLQUAD with TriScatteredInterp, or similar methods.

**Platform:**Matlab, Scripts**Publisher:**Ben Petschel**Date:**26-05-2013**Size:**10 KB

**Progetto Calcolo Parallelo**- License: Freeware

Progetto per il laboratorio del corso di Calcolo Parallelo DEI @ UniversitA degli Studi di Padova Algoritmo per generare la **Convex** **Hull** di un set di punti nel piano

Progetto Calcolo Parallelo License - Academic Free License (AFL).

**Platform:**WinOther**Publisher:**Pcpch**Date:**

**Java Convex Optimizer**- License: Freeware

Java **Convex** Optimizer is designed as an useful Open Source library that's been implemented in the Java programming language.

It was built in order to address the problem of solving a **convex** minimization with equalities and inequalities contraints.

.

**Platform:**WinOther**Publisher:**alberto trivellato**Date:**

**OBJ To Convex Physics**- License: Freeware

OBJ To **Convex** Physics is a lightweight and easy to use application designed to help you convert geometry OBJ files into **convex** meshes, which you can use in physics libraries.

OBJ To **Convex** Physics only runs using the command prompt and it won't pose any problem to those who are familiar with the console. Just specify the input and output file names and let the program do the rest.

.

**Platform:**Windows**Publisher:**cireneikual**Date:**

**Hull Viewer Work Preparation Manager**- License: Shareware

**Hull** Viewer Work Preparation Manager is designed to help engineers inspect and overview the details of a **hull** 3D model. It allows you to change the angle and to rotate the model in order to detect anomalies.

The application's main purpose is to provide visual information but you can also get structural details such as material, thickness, weight or size.

.

**Platform:**WinOther**Publisher:**Nupas-Cadmatic**Date:**

**Chine Hull Designer**- License: Shareware

Chine **Hull** Designer is a n easy to use program that allows you to create models and panels for hard chine construction. Find Center of Boyancy, Center of Lateral Area, Length Waterline, and righting moment (pitched or heeled) among other calculations.

You can use this program to create patterns for stem, stern, bulkheads, up to 10 chines, and up to 8 frames for construction.

.

**Platform:**WinOther**Publisher:**Carlson Design**Date:**

**Quadratic programming by Wolf's method**- License: Freeware

This script is capable of solving a **convex** quadratic programming problem by Wolf's method. For the convergence of the algorithm it is necessary that either Hessian of the objective function be positive definite or positive semidefinite Hessian with linear term zero. For theory of Wolf method and QPP one may see "Numerical Optimization with Applications, Chandra S., Jayadeva, Mehra A., Alpha Science Internatinal Ltd, 2009.".

**Platform:**Matlab, Scripts**Publisher:**Bapi Chatterjee**Date:**11-06-2013**Size:**10 KB

**Non Convex Algorithms for Group Sparse Optimization**- License: Freeware

Non **Convex** Optimization Algorithms for Group Sparsity
Solves a dummy OFDM sparse channel estimation problem
Reweighted Lm,p algorithm for noiseless case
min||x||_m,p s.t. y = Ax
Reweighted Lm,p algorithm for noisy case
min||x||_2,p s.t. ||y - Ax||_q
Smoothed L2,0 algorithm solves a smooth version of
min||x||_2,0 s.t. y = Ax
Reweigted Lm,p is an extension of the Lp algorithm proposed in:
Rick Chartrand and Wotao Yin, "Iteratively reweighted algorithms for compressive sensing", in 33rd International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2008
Smoothed L2,0 is the group version of the SL0 algorithm:
Hossein Mohimani, Massoud Babaie-Zadeh, Christian Jutten, "A fast approach for overcomplete sparse decomposition based on smoothed L0 norm", IEEE Transactions on Signal Processing, Vol.

**Platform:**Matlab, Scripts**Publisher:**Angshul Majumdar**Date:**06-05-2013**Size:**10 KB

**Construction of Attainable Region for van de Vusse Kinetics**- License: Freeware

We obtain the extended **convex** attainable region for van de Vusse kinetics using CSTRs and PFRs with and without mixing and bypass.
Reference: fig 6.8 page 223 in Seider, Seader and Lewin, Product & Process Design Principles, 2nd Edition, Wiley, 2004.

**Platform:**Matlab, Scripts**Publisher:**Housam Binous**Date:**18-06-2013**Size:**10 KB

**N-DIMENSIONAL CONVEX HULL: QUICKER HULL ALGORITHM**- License: Freeware

The Matlab convhulln is a gateway to the quickhull algorithm ( see www.qhull.org ). In my opinion, one weak point of this mex routine is that it processes all the points without performing any preliminary filtering.
In many cases it would be faster if only the point that can be part of the convhull were send to the quick **hull** algorithm.
Here is proposed an algorithm that can reduce the number of points before sending them to the mex routine.
For large models in dimensions lower than 6 the speed improvement can be even of several factors.

**Platform:**Matlab, Scripts**Publisher:**Luigi Giaccari**Date:**01-03-2013**Size:**10 KB

**Pareto surface navigator**- License: Freeware

This builds a navigation GUI for navigating n-dimensional **convex** Pareto surfaces interactively. It requires linprog from the
optimization toolbox, but can probably be replaced easily with a free version. The linear programs solved during navigation are very small and easy. It is assumed that all objectives are 'minimize' objectives. Thus normal navigation mode is to pull sliders downward.
mnav(pSurf) is how you call it. pSurf is an mxn matrix, (the pareto Surface) where m is the numberof points on the surface, and n is the dimension of the space.

**Platform:**Matlab, Scripts**Publisher:**David Craft**Date:**19-01-2013**Size:**133 KB

**Triangulate vertices on a sphere**- License: Shareware

Triangulate a set of points on the unit sphere using idea of stereographical projection.
Steps:
1. use the first vertex as projection center, project all the points onto a plane
2. call delaunay triangulation to triangulate those points on the plane
3. fill the hole by connecting the first vertex to the **convex** **hull** of the other vertices in the plane
Proof: ? not yet.

**Platform:**Matlab, Scripts**Publisher:**Tianli Yu**Date:**08-04-2013**Size:**10 KB

**Superresolution Demo**- License: Shareware

This is a superresolution based on projection onto **convex** sets (POCS).
You can also compare the result with bilinear projection (using only
one of the frames).
To start, run sr_gui in Matlab..

**Platform:**Matlab, Scripts**Publisher:**Samuel Cheng**Date:**07-01-2013**Size:**3604 KB

**Convex Lens Game**- License: Shareware

Objective: Identify the Reflections using **Convex** Lens from Object to Image.
Note 1: The only 4 possible Reflections using **Convex** Lens are shown in GUI.
Note 2: Object-Image distance are NOT to be used to avoid any calculations.
Note 3: Multiple usage of Object-Image Reflection Combinations is allowed.
Note 4: Superposition of Reflections of Object will lead to assumed Image.
Note 5: Reflections of Object will follow Associative Law(Order Invariant).
Note 6: The Image of 1st Object will become the Source for the next Image.

**Platform:**Matlab, Scripts**Publisher:**Krishna Lalith**Date:**26-05-2013**Size:**72 KB