Pseudo-triangulations and their use in applied computational geometry

This thesis shows fundamental properties of pseudo-triangulation, its use as a planar tesselation and implementation of minimal pseudo-triangulation algorithm, which has triangulation as its input. Furthermore, this thesis examines usability of a walking algorithm and two versions of algorithm are proposed. The walking algorithm is also used in an incremental algorithm for a pseudo-triangulation construction. All proposed algorithms have been verified with implementation and experiments