Shapes and implementations in three-dimensional geometry

"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."

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Mucke, Ernst Peter

Contributors dc:contributor

• Edelsbrunner, Herbert

• Computer Science

Statement dc:rights

• Copyright 1994 Mucke, Ernst Peter

Language dc:language

eng

Identifier

AAI9416411
(UMI)AAI9416411

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/22398