Computational geometry and combinatorial algorithms play an important role in algebraic geometry. We report on several computational geometry and combinatorial algorithms needed for computing the genus of a plane complex algebraic curve with numeric coefficients.

A variety of questions in combinatorics lead one to the task of analyzing the topology of a simplicial complex, or a more general cell complex. However, there are few general techniques to aid in this investigation. On the other hand, the subjects of differential topology and geometry are devoted to precisely this sort of problem, except that the topological spaces in question are smooth manifo...

We study the fundamental properties of curvature in groupoids within the framework of synthetic differential geometry. As is usual in synthetic differential geometry, its combinatorial nature is emphasized. In particular, the classical Bianchi identity is deduced from its combinatorial one.

Karoly Bezdek and Egon Schulte are two geometers who have made important and numerous contributions to Discrete Geometry. Both have trained many young mathematicians and have actively encouraged the development of the area by professors of various countries. Karoly Bezdek studied the illumination problem among many other problems about packing and covering of convex bodies. More recently he has...