 IDEALS Home
 →
 College of Engineering
 →
 Browse College of Engineering by Contributor
Browse College of Engineering by Contributor "Edelsbrunner, Herbert"
Now showing items 115 of 15

(2002)We develop an algorithm and software for the construction and visualization of the skin surface in 3D in various ways, namely, a parametric representation, static and dynamic triangulations. The triangulation algorithm is ...
application/pdf
PDF (6MB) 
(2001)The thesis also gives algorithms for computing the theoretically defined measures or structures in each case. Using persistence, we may distinguish between topological noise and features of a space. This differentiation ...
application/pdf
PDF (10MB) 
(1990)Degenerate geometric data (e.g., three points on a line, four points on a circle) is known to create all sorts of special cases, some easy and some complicated, that have to be considered in implementations of geometric ...
application/pdf
PDF (4MB) 
(1988)We consider problems in geometric probing, the algorithmic study of determining a geometric structure or some aspect of that structure from the results of a mathematical or physical measuring device. A variety of problems ...
application/pdf
PDF (6MB) 
(1996)Macromolecules such as proteins and DNA have complex spatial structures which are often important for their biological functions. The idea of molecular shape and shape complementarity play crucial roles in protein folding, ...
application/pdf
PDF (4MB) 
(1992)Methods for interactive volume rendering of nonrectilinear 3D scientific data sets, such as those generated by the finite element method, are investigated. We focus on the use of projection methods, in particular splatting ...
application/pdf
PDF (6MB) 
(1996)Questions of chemical reactivity can often be cast as questions of molecular geometry. Common geometric models for proteins and other molecules are the space filling diagram, the solvent accessible surface and the molecular ...
application/pdf
PDF (4MB) 
(1993)A triangulation in the plane is a maximal connected plane graph with straight edges. It is thus a plane graph whose bounded faces are triangles. For a fixed set of vertices, there are, in general, exponentially many ways ...
application/pdf
PDF (6MB) 
(1994)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 ...
application/pdf
PDF (5MB) 
(1996)This thesis consists of three parts. In the first part we study the maintenance of a simplicial grid under changing density requirements. The proposed method works in any fixed dimension and generates grids by projecting ...
application/pdf
PDF (4MB) 
(2001)The persistent appearance of slivers in large threedimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove ...
application/pdf
PDF (6MB) 
(1995)This thesis consists of two parts dealing with combinatorial and computational problems in geometry, respectively. In the first part three independent problems are considered: (1) We determine an upper bound $\lfloor ...
application/pdf
PDF (6MB) 
(1998)Finally, we demonstrate the use of wave traversal for creating an auditory display of a simplicial complex. This has application particularly when the complex is large or higherdimensional, but audio has been shown to ...
application/pdf
PDF (5MB) 
(1994)Simplicial complexes are useful for modeling shape of a discrete geometric domain and for discretizing continuous domains. A geometric triangulation of a point set S is a simplicial complex whose vertex set is contained ...
application/pdf
PDF (4MB) 
(1996)We present scientific visualization techniques where our goal is to strike a better balance between the qualitative information provided by images and the quantitative measures often sought by scientists. Our particular ...
application/pdf
PDF (6MB)
Now showing items 115 of 15