This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
A d-dimensional polycube is a facet-connected set of cubes in d dimensions. Fixed polycubes are considered distinct if they differ in their shape or orientation. A proper d-dimens...
The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associat...
In this paper a framework for defining scale-spaces, based on the computational geometry concepts of α-shapes, is proposed. In this approach, objects (curves or surfaces) of incr...
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...