Titlebook: Geometric Modelling; Dagstuhl 1999 Comput Guido Brunnett,Hanspeter Bieri,Gerald Farin Conference proceedings 2001 Springer-Verlag/Wien 2001

無(wú)脊椎

Surface Reconstruction Using Adaptive Clustering Methods,mensional space, without connectivity information, our method reconstructs a triangulated surface model in a two-step procedure. First, we apply an adaptive clustering technique to the given set of points, identifying point subsets in regions that are nearly planar. The output of this clustering ste

Tractable

An Algorithm to Triangulate Surfaces in 3D Using Unorganised Point Clouds,rst build a triangular mesh to obtain an approximate surface representation. In this paper we describe an algorithm which works by creating and merging local triangular complexes to obtain an unambiguous 2D-manifold triangulation. We use all the given sample points as vertices, which is a natural re

Brain-Imaging

Hypopnea

A Constraint-Based Method for Sculpting Free-Form Surfaces, automatically follows changes of the curve keeping a predefined set of constraints satisfied, specifically the incidence and tangency along one or several surface-curves. We review and update our approach presented earlier [18] and show how the curve-surface composition can be expressed as a linear

Fibrillation

Exploiting Wavelet Coefficients for Modifying Functions,ets. This enables us to separate several aspects of a function and modify one selected exclusively. The quality of this approach is dependent on the choice of the wavelet decomposition. We demonstrate for Haar-wavelets how to estimate changes a priori and how to avoid modifications locally. A more g

水土

Capture

Data-Dependent Triangulation in the Plane with Adaptive Knot Placement,e describe a scheme for constructing a hierarchy of triangulations that approximates a given data set at varying levels of resolution. Intermediate triangulations can be associated with a particular level of a hierarchy by considering their approximation errors. We present a data-dependent triangula

平常

,Implicit Surfaces Revisited — ,-Patches,due to the lack of proper control for the interior of complex shapes and control of separate branches. The main attraction of implicit formulations is, however, that they represent a . based on distance functions. This property motivates our scheme, wherein classical implicit techniques are mixed wi

館長(zhǎng)

Mapping Design Computing Researchthm for efficient tracking of the geodesics on these surfaces is presented. Existing methods for plane offset curves are adapted to generate .-spline approximations of parallel curves on arbitrary surfaces. An algorithm to determine singularities and cusps in the parallel curve is established.

600