BLOG | Union N aligning rectangles’ area

This is a follow up for merging intervals. Instead of merging 1D items, consider the case when each interval comes with a height, and compute the total overlapping area. We would use a sweep line algorithm for this question. Maintain a horizontal projection for all rectangles. Use 1D union to compute the total union area.… Continue reading BLOG | Union N aligning rectangles’ area

BLOG | How long should it take to find and frame a research idea, from thought to peer review

Before investing all your efforts and time in a research, it's highly advised that you think about the following questions: Does this topic interest me and worth spending more than one month to work on? What's the usage of my results? Can I turn it into a product? Does it have real business values? Where… Continue reading BLOG | How long should it take to find and frame a research idea, from thought to peer review