Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
There are many diverse algorithms for generating a first mesh, refining it and improving it. A tool that allows us to interchange these algorithms according to the requirements ...
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
The mainstream approach to estimate epipolar geometry from two views requires matching the projections of at least 4 non-coplanar points in the scene, assuming a full projective c...
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...