Surface Reconstruction from Noisy Point Clouds

We show that a simple modification of the power crust algorithm for surface reconstruction produces correct outputs in presence of noise. This is proved using a fairly realistic noise model. Our theoretical results are related to the problem of computing a stable subset of the medial axis. We demostrate the effectiveness of our algorithm with a number of experimental results

Multi-Dimensional Medial Geometry: Formulation, Computation, and Applications

Medial axis is a classical shape descriptor. It is a piece of geometry that lies in the middle of the original shape. Compared to the original shape representation, the medial axis is always one dimension lower and it carries many intrinsic shape properties explicitly. Therefore, it is widely used in a large amount of applications in various fields. However, medial axis is unstable to the boundary noise, often referred to as its instability. A small amount of change on the object boundary can cause a dramatic change in the medial axis. To tackle this problem, a significance measure is often associated with the medial axis, so that medial points with small significance are removed and only the stable part remains. In addition to this problem, many applications prefer even lower dimensional medial forms, e.g., shape centers of 2D shapes, and medial curves of 3D shapes. Unfortunately, good significance measures and good definitions of lower dimensional medial forms are still lacking. In this dissertation, we extended Blum\u27s grassfire burning to the medial axis in both 2D and 3D to define a significance measure as a distance function on the medial axis. We show that this distance function is well behaved and it has nice properties. In 2D, we also define a shape center based on this distance function. We then devise an iterative algorithm to compute the distance function and the shape center. We demonstrate usefulness of this distance function and shape center in various applications. Finally we point out the direction for future research based on this dissertation

ARTIST-DRIVEN FRACTURING OF POLYHEDRAL SURFACE MESHES

This paper presents a robust and artist driven method for fracturing a surface polyhedral mesh via fracture maps. A fracture map is an undirected simple graph with nodes representing positions in UV-space and fracture lines along the surface of a mesh. Fracture maps allow artists to concisely and rapidly define, edit, and apply fracture patterns onto the surface of their mesh. The method projects a fracture map onto a polyhedral surface and splits its triangles accordingly. The polyhedral mesh is then segmented based on fracture lines to produce a set of independent surfaces called fracture components, containing the visible surface of each fractured mesh fragment. Subsequently, we utilize a Voronoi-based approximation of the input polyhedral mesh’s medial axis to derive a hidden surface for each fragment. The result is a new watertight polyhedral mesh representing the full fracture component. Results are aquired after a delay sufficiently brief for interactive design. As the size of the input mesh increases, the computation time has shown to grow linearly. A large mesh of 41,000 triangles requires approximately 3.4 seconds to perform a complete fracture of a complex pattern. For a wide variety of practices, the resulting fractures allows users to provide realistic feedback upon the application of extraneous forces

Tangent-ball techniques for shape processing

Shape processing defines a set of theoretical and algorithmic tools for creating, measuring and modifying digital representations of shapes.  Such tools are of paramount importance to many disciplines of computer graphics, including modeling, animation, visualization, and image processing.  Many applications of shape processing can be found in the entertainment and medical industries. In an attempt to improve upon many previous shape processing techniques, the present thesis explores the theoretical and algorithmic aspects of a difference measure, which involves fitting a ball (disk in 2D and sphere in 3D) so that it has at least one tangential contact with each shape and the ball interior is disjoint from both shapes. We propose a set of ball-based operators and discuss their properties, implementations, and applications.  We divide the group of ball-based operations into unary and binary as follows: Unary operators include: * Identifying details (sharp, salient features, constrictions) * Smoothing shapes by removing such details, replacing them by fillets and roundings * Segmentation (recognition, abstract modelization via centerline and radius variation) of tubular structures Binary operators include: * Measuring the local discrepancy between two shapes * Computing the average of two shapes * Computing point-to-point correspondence between two shapes * Computing circular trajectories between corresponding points that meet both shapes at right angles * Using these trajectories to support smooth morphing (inbetweening) * Using a curve morph to construct surfaces that interpolate between contours on consecutive slices The technical contributions of this thesis focus on the implementation of these tangent-ball operators and their usefulness in applications of shape processing. We show specific applications in the areas of animation and computer-aided medical diagnosis.  These algorithms are simple to implement, mathematically elegant, and fast to execute.Ph.D.Committee Chair: Jarek Rossignac; Committee Member: Greg Slabaugh; Committee Member: Greg Turk; Committee Member: Karen Liu; Committee Member: Maryann Simmon