About

This is a blog maintained by the editors of Hugi Magazine which deals with coding (programming). We would like to post original tutorials as well as links to tutorials on other websites. Topics include, among others:

  • Mathematics
  • Algorithms and Data Structures
  • 2D Graphics
  • 3D Graphics
  • Sound
  • Code Optimization
  • Compression
  • File Formats
  • Programming Languages
  • Operating Systems
  • Exotic Platforms
  • Demo Development
  • Game Development 

If you want to submit a tutorial please contact Adok at cdvolko (at) gmail (dot) com. Preferred formats are TXT, DOC and ODT.

Comments

Post a Comment

Popular posts from this blog

Volko Hull - An Alternative to Convex Hull

When you have a point cloud and want to obtain the shape, you can use the convex hull or the alpha shape algorithm. In the computational geometry library I am using in my projects, CGAL, these algorithms are built-in, but they have a disadvantage: the points are not output in the correct order. I first tried to solve this problem by implementing a convex hull algorithm myself that outputs the points in the correct order, but this did not always help since it ignored concave corners. Therefore I wrote my own algorithm to replace it. My algorithm divides the rectangular area of the given cluster into four triangles and computes the points belonging to the outer border of each triangle. Thus it also includes concave corners. Imagine this to be the rectangle: -------- |\    /| | \ A/ | | C\/  | |  /\D | | /B \ | |/    \| -------- If it is a square, we can assume that its sides have a length of 2a. The coordinates of the mid point are always (0, 0). Th...
Read more