In this post I would like to discuss a proof of the fact that although three dimensional Constrained Delaunay triangulation can be constructued from incremental modification of corresponding Delaunay triangulation, its 2D counter-part does not require such measures. That is,...

In this post, I will discuss Jordan Curve Theorem. It is deceptively simple to state:_ Any continous simple curve in the plane, separates the plane into two disjoint regions, the inside and the outside_.

I will first discuss the theorem...

These days I have been trying to solve the problem of detecting and removing self-intersections from a three-dimensional(3D) polygonal mesh. In this post(or even possibly in the upcoming posts), I will discuss this problem in detail and my ideas to...

I have finally implemented the algorithm I proposed in my previous post. I have noticed that it is simply not terminating :(. I have checked multiple times to see if there are any infinite loops in there, but it...

I have no idea right now, but I have added this post as a TODO.

I am studying a paper by CGAL authors describing their approach to symbolic perturbation technique. This approach has been used in Delaunay_triangulation_3 class to be able to compute unique Delaunay triangulation even in the presence of degneracies in the...

One day while browsing whole variety of octocats available in Octodex, my mind started reasoning about why GitHub might have chosen Octocat as their mascot. Octocat is hybrid of cat and octopus, so how does it relate to programming?

As the title suggests, I am going to discuss about bistellar flips. Bistellar flips

I have been trying to implement the solution to 3-cell marking problem that I discussed earlier. In order to avoid duplicate points of intersection while counting number of intersections of a random ray from the barycenter of each tetrahedron...

In this post, I would like to ponder on the possible solutions to the problem I presented in my previous post. Just as a recap, the problem is: Given a tetrahedral mesh and a surface mesh(the region of interest...

As has been the nature of articles listing Open problems in any domain, expect this post to be under construction forever. I want to enter in the field of Tetrahedral mesh generation for which I am gathering the list of...

In this post I want to discuss a practical issue which I am facing right now while implementing an adaptive tetrahedral mesh generator. The problem is straightforward to cast and you can see my StackExchange question on the same...

After completing an exercise on representing a cube using CGAL’s linear cell complex(or LCC), I now come back to my original problem. Given a set of points and triangles in a (say PLY) file, I need to generate...

In an attempt to implement Constrained Delaunay tetrahedralization algorithm proposed by Hang Si, the CDTGenerator, I have started to learn about a beautiful concept in topology called Combinatorial Maps. This datastructure can be used to represent orientable subdivided d-dimensional...

I have now added a new github page for my project on Constrained Delaunay Tetrahedralization. This is an implementation of a paper by Hang Si et. al. “Meshing Piecewise Linear Complexes using CDT”. I have used CGAL extensively in...

This is my first blog post!! You can visit my ongoing work on development of a structured light 3D scanner in my Coded phase shift 3D scanning repository. In this blog, I will regularly update you regarding my project...