Algorithms

Generate Uniform Random Points within a Circle

Let’s say we have only access to uniform random number generator which generates random points between 0 and 1 (let’s denote it rand()), and we are asked to generate uniformly random points within a given circle with specified radius (let’s say for now). The first idea that comes to mind is to utilize the random… Continue reading Generate Uniform Random Points within a Circle

Travel · Gezi

How to get to Kastellorizo from Kaş?

To my experience, it was one of the simplest international travel you can do while in Turkey. There is no tight airport security screening, no crowds and no hassles. You start your day in a nice Mediterranean morning in Kaş, Antalya and get to the office of Meis Express to get your ticket. The ferryboat… Continue reading How to get to Kastellorizo from Kaş?

Travel · Gezi

Kaş’dan Meis’e nasıl gidilir?

Kaş-Meis arası yolculuk, eğer vize sorunu yoksa, Türkiye’den gitmesi en kolay rotalardan birisi olarak kabul edilebilir. Bizim yaptığımız sabah 8 civarı Kaş’a vardıktan sonra direk Meis Express‘in ofisine gidip Meis için o gün için bilet/yer olup olmadığını sormak oldu. Internetten feribotun saat 10’da kalkacağını biliyorduk. Oradaki görevliler de yer olduğunu söyleyince işlemleri başlattık. Günübirlik 25… Continue reading Kaş’dan Meis’e nasıl gidilir?

Algorithms · Animation

Dijkstra vs bi-directional Dijkstra comparison on sample US Road Network

.. under construction .. Here, we compare the progression of classical and bi-directional Dijkstra Algorithms as applied to simple 2D rectangular and hexagonal grids as well as more destructured US road network. The road network is intentionally sampled and reduced to a minimum spanning tree for easier visualization. The real connections between nodes can be… Continue reading Dijkstra vs bi-directional Dijkstra comparison on sample US Road Network

Algorithms · Animation

Prim’s Algorithm Progression Animation for randomly distributed points

For a given set of randomly distributed points in 2-dimensional space, Prim’s algorithm is utilized to find the minimum total distance from a randomly selected origin point (P_origin). Here, the progress of how the distances are selected by the algorithm at the first instant along the way to reach the minimum spanning tree (MST) is… Continue reading Prim’s Algorithm Progression Animation for randomly distributed points