Shapes and Implementations in Three-dimensional Geometry

Résumé du livre

Abstract: "Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is often useful or required to compute what one might call the 'shape' of the set. For that purpose, this thesis deals with the formal notion of the family of alpha shapes of a finite point set in three-dimensional space. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a real parameter controlling the desired level of detail. Algorithms and data structures are presented that construct and store the entire family of shapes, with a quadratic time and space complexity, in the worst case.