Latest Tech News

Stay updated with the latest in technology, AI, cybersecurity, and more

Filtered by: vertex Clear Filter

Rust tool for generating random fractals

Chaos Game Fractal Generator A simple command-line application written in Rust for generating fractals using the 'Chaos Game' algorithm. Table of Contents Algorithm Description This application generates fractals using the following simple, iterative algorithm: Define the $n$ vertices of a regular polygon Choose a random initial point within the polygon Select one of the polygon's vertices at random Move the current point a specific ratio, $r$ , of the distance towards the chosen vertex Rep

Implementing a Foil Sticker Effect

In this post, I’ll walk you through how to create a custom shader in Three.js that simulates the look of a foil sticker, complete with angle-dependent iridescence and sparkling metallic flakes. The goal is to capture that premium, holographic effect you see on collectible stickers, trading cards, and high-end packaging, but to render it in real time directly in the browser. Iridescence If you’ve ever tilted a holographic sticker or watched sunlight catch on a soap bubble, you’ve seen iridescen

Iterative DFS with stack-based graph traversal (2024)

Depth-first search (DFS) on a graph (binary tree or otherwise) is most often implemented recursively, but there are occasions where it may be desirable to consider an iterative approach instead. Such as when we may be worried about overflowing the call stack. In such cases it makes sense to rely on implementing DFS with our own stack instead of relying on our program's implicit call stack. But doing so can lead to some problems if we are not careful. Specifically, as noted in another blog post,

A fast 3D collision detection algorithm

This article will assume some familiarity with narrow phase collision detection methods and associated geometric concepts such as the Minkowski sum. A few years ago I was watching Dirk’s great presentation, The Separating Axis Test between Convex Polyhedra (video, slides). Around the 18 minute mark (slide 29) he starts talking about overlaying Gauss maps of convex polyhedra to find the faces of their Minkowski difference. Figure 1: A gauss map for two convex hulls The upshot is that all faces