In this submission, finite element mesh, Delaunay triangulations and Voronoi diagrams are generated through the use of the convex hull algorithm, which is implemented in an optimized way that maximizes speed and performance. The Delaynay triangulation and Voronoi diagram algorithms are essentially based on the convex hull algorithm. Information about the code and the ways to be used is shown in 'Theory of convex hulls, Delaunay triangulations and Voronoi diagrams'. The convex hull algorithm is applied by the function 'convhull_nd', the Delaunay triangulation by the function 'delaunay_nd' and the Voronoi diagram by the function 'voronoi_nd'. All functions included in this package can be used for any dimension n. The use of the three aforementioned functions is illustrated by many examples, included in the file 'Contents'.
The functions included in this submission can be used for the generation of finite element and boundary element meshes, which are utilized for discretization of various media, structural or not, to be numerically analysed.
Apart from this, they can be used to solve various problems of computational geometry, such as:
 convex hulls
 intersections
 triangulation and partitioning
 line arrangements and duality
 Voronoi diagrams and Delaunay triangulations
 Point in polygon, etc.
It has to be noted that most of these problems (many of which are included in this package as solved examples) are solved using essentially the convex hull algorithm.
References:
[1] The Quickhull Algorithm for Convex Hull, C. Bradford Barber, David P. Dobkin and Hannu Huhdanpaa, Geometry Center Technical Report GCG53, July 30, 1993.
[2] Voronoi Diagrams from Convex Hulls, Kevin Q. Brown, Information Processing Letters, Vol.9, No.5, December 16, 1979
[3] Voronoi Diagrams and Arrangements, Herbert Edelsbrunner and Raimund Seidel, Discrete & Computational Geometry 1:2544, 1986
1.2  Minor amendments. 

1.1.0.0  Content offered as a toolbox (.mltbx file), 
Create scripts with code, output, and formatted text in a single executable document.
George Papazafeiropoulos (view profile)
@jahanzaib ahmad:
Check this:
https://www.mathworks.com/matlabcentral/fileexchange/48509computationalgeometrytoolbox?s_tid=mlc_fex_email_activity#feedback95ebf9fce733482ca68031b824dc6946
jahanzaib ahmad (view profile)
hello . I m using scattered points intersection 3d convex polygons but there is a situation when the polygons are intersecting but no vertices of the polygons are inside each other .means the line connecting the vertices intersect with the other polygon .is there any solutions or function ? please
Leo McCormack (view profile)
Sahar Ghanem (view profile)