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.
引用
Hyongju Park (2024). Polytope bounded order-2 Voronoi diagram in 2D/3D (https://github.com/hyongju/Polytope-bounded-order2-Voronoi-diagram/releases/tag/1.2.0), GitHub. 取得済み .
MATLAB リリースの互換性
プラットフォームの互換性
Windows macOS Linuxカテゴリ
タグ
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!GitHub の既定のブランチを使用するバージョンはダウンロードできません
バージョン | 公開済み | リリース ノート | |
---|---|---|---|
1.2.0 | See release notes for this release on GitHub: https://github.com/hyongju/Polytope-bounded-order2-Voronoi-diagram/releases/tag/1.2.0 |
||
1.1.0.0 | Renamed the title.
|
|