I talked about convex hulls some time ago in an alpha shape post.
The convex hull is probably one of the most basic computational geometry algorithms, and because of that it is present in almost, if not all, geometry/cad/gis libraries and software packages. In this post you will find an explanation of one of the existing algorithms to compute it, an implementation with C++, plus a set of scripts to generate various point clouds and the corresponding hulls.
- Describe one of the possible convex hull algorithms
- Implement the algorithm in C++
- Provide various scripts to generate random point clouds and compute its convex hulls
I won’t lie to you, this post might be boooring ;-).
continue to this long post
Seems that I’m on a combo of good reads (Endurance, CODE and now Flatland).
This is the story of a square living on a 2D world and how it becomes aware of the 3D world. Does not sound interesting? well, I think it is.
The book was written in 1884 as a satirical novel on the Victorian stratified society, and an examination of different dimensions. Nowadays is still interesting, at least for the definitions on various dimensions.
If you run into a printed copy buy it! is one of those novels that I would love to have in my shelf. If you are planning to buy any digital version, stop right here! There’s an online version in HTML at the Minnesota Science and technology center. Is not difficult to use Calibre or Online convert to obtain a nice ebook for your reader.
Online version at the Minnesota Science and technology center ⇒GO
Online Convert ⇒GO
Filed under books, curious