This post is the platform for posting materials for course “Introduction to Computer Graphics” for summer semester.
Author Archives: mshgrid
My Research
This post is a collection of updates from my research carreer condensed in one page.
Webovská Grafika
Materiály pre predmet Webovská Grafika na FMFI UK, Bratislava.
Materials for Web Graphics course on FMFI UK, Bratislava.
Doplnkové Cvičenia z Matematiky
(Slovak) Stránka s podmienkami absolvovania a zadaniami predmetu Doplnkové cvičenia z matematiky (PriF UK 2021)
On the New Meaning of Life: Part II
A Possible Resolution of the Aforementioned and some Additional Philosophical Problems My previous post introduced a variety of philosophical premises for understanding consciousness and its formation from matter, the birth of morality, and the overall context we find ourselves in. Since the complexity of life is unbearable for virtually all of us, in this essay, …
On the New Meaning of Life: Part I
Every consciousness wants to maximize its chances of survival (passing on their information content). Hence, it uses a variety of tools to map its surroundings and formulate predictive models to minimize surprise.
Overcoming Lack of Motivation
10 Tips on Combatting Resistance I understand that compared to my previous, highly technical, posts, this will be a more general self-help type of article applicable beyond my domain of software development. I am no self-help guru, nor do I claim to be perfect at the tips I recommend, but nevertheless I have found some …
Computing the Sign of Discrete Distance Fields
Determining whether a point in space is inside/outside of a given shape depends entirely on the shape’s topological properties. Shapes with holes and/or self-intersections do not have a mathematically guaranteed interior and exterior (by Jordan’s curve theorem). However, with sufficiently fine voxel outline of a given polygonal mesh, we can enclose the approximate interior and flood-fill the remaining voxels to achieve sign computation of our distancie field.
The Fast Sweeping Algorithm
The distance function is a solution to a type of Eikonal equation. The fastest O(n) method for numerically solving Eikonal equations was introduced by H. Zhao in his 2005 paper called the Fast Sweeping Method.
Octree for Voxel Outlines of a Triangular Mesh
The advantage of octrees is that they can subdivide the surrounding space into self-similar cells. Starting with a bounding cube we can then produce cells that can be thought of as a subset of a regular grid.
Martin Cavarga 