Polytope bounded order-2 Voronoi diagram in 2D/3D

The function creates arbitrary polytope bounded order-2 Voronoi diagram in 2D/3D

Polytope-bounded-order2-Voronoi-diagram

This program creates order-2 Voronoi diagram with set of points in 2D/3D polygon. The function uses my previous program "polybnd_voronoi.m" that computes polytope bounded ordinary Voronoi diagram.

Here are the description of the uploads.

"DEMO.m" provides an example

"polybnd_order2voronoi.m" is the main function that obtains polytope bounded order-2 Voronoi diagram

"polybnd_voronoi.m" is a function that obtains polytope bounded Voronoi diagram

"pbisec.m" obtains half space created with perpendicular bisector of two points in the form Ax <= b

"MY_con2vert.m" convert a convex set of constraint inequalities into the set of vertices at the intersections of those inequalities (written by Michael Keder)

"vert2lcon.m" used for finding the %linear constraints defining a polyhedron in R^n given its vertices (written by Matt Jacobson and Michael Keder)

"inhull.m" tests if a set of points are inside a convex hull (written by John D'Errico)

"MY_setdiff.m", "MY_intersect.m" are much fasten than MATLAB built-in "setdiff.m", "intersect.m". Two functions are written by Nick (http://www.mathworks.com/matlabcentral/profile/authors/1739467-nick)

"distinguishable_colors.m" picks colors that are maximally perceptually distinct. The function is written by Timothy E. Holy.