{"id":38,"date":"2014-04-21T06:57:00","date_gmt":"2014-04-21T06:57:00","guid":{"rendered":"http:\/\/m-shaeri.ir\/blog\/?p=38"},"modified":"2019-11-16T05:09:14","modified_gmt":"2019-11-16T05:09:14","slug":"convex-hulls","status":"publish","type":"post","link":"https:\/\/mshaeri.com\/blog\/convex-hulls\/","title":{"rendered":"Convex Hulls"},"content":{"rendered":"

Last night I was surfing in my PC,I found the convex hull program in the folder of academic projects , I remember that I coded it about a year ago when I was passing the computianal geometery course at Beheshti university. it motivates me to write new post in the blog about Convex Hulls Problem.<\/p>\n

Download Convex Hulls Program here<\/a>.<\/p>\n

The Convex Hull is one of the fundamental Problems in computational geometry.
\nthe problem is : Given a set X of points, find the smallest convex shape (Hull) that contains X.
\na shape (Hull) is convex if for every pair of points q and p within the shape, the straight line that joins q to p is also within the shape, i.e. the line does not cross the borders of the shape.<\/p>\n

\"Convex<\/a>
Convex Hull<\/figcaption><\/figure>\n

There exist Several Algorithms represented for solving Convex Hulls, e.g. Gift wrapping – O(n^2) , Graham scan \u2014 O(n log n) and Incremental convex hull algorithm \u2014 O(n log n).<\/p>\n

\"Convex<\/a>
Computed convex hull for points<\/figcaption><\/figure>\n

The use cases of Convex Hull problem is in Image Processing, GIS, Robot Motion, statictis and Surprisingly in chemistry and petroleum industry!!<\/p>\n

This program is written by C# 2008.\u00a0hope you find this program and post useful .<\/p>\n

Download Convex Hulls Program here<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"

Last night I was surfing in my PC,I found the convex hull program in the folder of academic projects , I remember that I coded … <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[21,1],"tags":[11,7,10,12],"_links":{"self":[{"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/posts\/38"}],"collection":[{"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/comments?post=38"}],"version-history":[{"count":7,"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/posts\/38\/revisions"}],"predecessor-version":[{"id":163,"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/posts\/38\/revisions\/163"}],"wp:attachment":[{"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/media?parent=38"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/categories?post=38"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/mshaeri.com\/blog\/wp-json\/wp\/v2\/tags?post=38"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}