Abstract: The invention provides techniques for wrapping a two-dimensional texture conformally onto a surface of a three dimensional virtual object within an arbitrarily-shaped, user-defined region. The techniques provide minimum distortion and allow interactive manipulation of the mapped texture. The techniques feature an energy minimization scheme in which distances between points on the surface of the three-dimensional virtual object serve as set lengths for springs connecting points of a planar mesh. The planar mesh is adjusted to minimize spring energy, and then used to define a patch upon which a two-dimensional texture is superimposed. Points on the surface of the virtual object are then mapped to corresponding points of the texture. The invention also features a haptic/graphical user interface element that allows a user to interactively and intuitively adjust texture mapped within the arbitrary, user-defined region.

Abstract: Methods of modeling a three-dimensional surface structure include partitioning three-dimensional object data into regions of a Morse complex and generating a feature skeleton having a plurality of smooth edges and a plurality of vertices separating the regions of the Morse complex. Operations are also performed to thicken the feature skeleton by replacing the plurality of smooth edges with corresponding pairs of curves that locate longitudinal boundaries of transitions between primary regions of the feature skeleton. The thickening operations may also include replacing each of the plurality of vertices with a corresponding loop of edges, using setback-type vertex blends.

Abstract: Methods, apparatus and computer program products provide efficient techniques for reconstructing surfaces from data point sets. These techniques include reconstructing surfaces from sets of scanned data points that have preferably undergone preprocessing operations to improve their quality by, for example, reducing noise and removing outliers. These techniques include reconstructing a dense and locally two-dimensionally distributed 3D point set (e.g., point cloud) by merging stars in two-dimensional weighted Delaunay triangulations within estimated tangent planes. The techniques include determining a plurality of stars from a plurality of points pi in a 3D point set S that at least partially describes the 3D surface, by projecting the plurality of points pi onto planes Ti that are each estimated to be tangent about a respective one of the plurality of points pi. The plurality of stars are then merged into a digital model of the 3D surface.