Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

Geometric computing is creeping into virtually every corner of science and engineering, from design and manufacturing to astrophysics and cartography. This report describes presentations made at a workshop focused on recent advances in this computational geometry field. Previous Dagstuhl workshops on computational geometry dealt mostly with theoretical issues: the development of provably effici...

An astral configuration (pq, nk) is a collection of p points and n straight lines, usually in the Euclidean plane, where every point is incident with q straight lines, every line is incident with k points, and there are precisely b q+1 2 c symmetry classes (transitivity classes) of lines and b 2 c symmetry classes of points. An odd astral configuration is an astral configuration where at least ...

Although geometry is as old as mathematics itself, discrete geometry only fully emerged in the 20th century, and computational geometry was only christened in the late 1970s. The terms ``discrete'' and “computational” fit well together as the geometry must be discretized in preparation for computations. “Discrete” here means concentration on finite sets of points, lines, triangles, and other ge...