# Publikationen

## Welfenlab Reports

Durch unsere Veröffentlichungsreihe *Welfen Laboratory Reports* informieren wir über Forschungsarbeiten an unserem Lehrstuhl, unter anderem werden auf diesem Weg ausgewählte studentische Abschlussarbeiten publiziert.

## Publikationen nach Jahren

Hier finden sie sämtliche Publikationen des Welfenlab geordnet nach Art der Publikation und Erscheinungsdatum.

Sie finden hier auch ein vollständige Publikationsliste.

1979 . . . 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 |

**1979 . . . 2009 **

Artikel |

2009 |

Franz-Erich Wolter, Bernd Hamann, Konrad Polthier Editorial Computer-Aided Design 41 699-700 2009 Beschreibungstext anzeigen This special issue has its origin in the NASAGEM 07 workshop that took place in October 2007, held as part of a sequence of events including the HAPTEX 07 workshop and the Cyberworlds 07 conference. Beschreibungstext verbergen |

Martin Reuter, Franz-Erich Wolter, Martha Shenton, Marc Niethammer Laplace-Beltrami Eigenvalues and Topological Features of Eigenfunctions for Statistical Shape Analysis
Computer Aided Design 41 739 - 755 2009 Beschreibungstext anzeigen This paper proposes the use of the surface based Laplace-Beltrami and the volumetric Laplace eigenvalues and -functions as shape
descriptors for the comparison and analysis of shapes. These spectral measures are isometry invariant and therefore allow for
shape comparisons with minimal shape pre-processing. In particular, no registration, mapping, or remeshing is necessary. The
discriminatory power of the 2D surface and 3D solid methods is demonstrated on a population of female caudate nuclei (a subcortical
gray matter structure of the brain, involved in memory function, emotion processing, and learning) of normal control subjects and
of subjects with schizotypal personality disorder. The behavior and properties of the Laplace-Beltrami eigenvalues and -functions
are discussed extensively for both the Dirichlet and Neumann boundary condition showing advantages of the Neumann vs. the
Dirichlet spectra in 3D. Furthermore, topological analyses employing the Morse-Smale complex (on the surfaces) and the Reeb
graph (in the solids) are performed on selected eigenfunctions, yielding shape descriptors, that are capable of localizing geometric
properties and detecting shape differences by indirectly registering topological features such as critical points, level sets and integral
lines of the gradient field across subjects. The use of these topological features of the Laplace-Beltrami eigenfunctions in 2D and
3D for statistical shape analysis is novel.
Beschreibungstext verbergen |

2008 |

Guido Böttcher, Dennis Allerkamp, Daniel Glöckner, Franz-Erich Wolter Haptic Two-Finger Contact with Textiles The Visual Computer 24 911-922 Springer 2008 Beschreibungstext anzeigen Real-time cloth simulation involves many computational challenges to be solved, particularly in the context of haptic applications, where high frame rates are necessary for obtaining a satisfying experience. In this paper, we present an interactive cloth simulation system that offers a compromise between a realistic physics-based simulation of fabrics and a haptic application meeting high requirements in terms of computation speed. Our system allows the user to interact with the fabric using two fingers. The required performance of the system is achieved by introducing an intermediate layer responsible for the simulation of the small part of the surface being in contact with the fingers. Beschreibungstext verbergen |

2007 |

Nadia Magnenat-Thalmann, Franz-Erich Wolter Special issue on Cyberworlds'2007 Editorial The Visual Computer 24 857 2007 Beschreibungstext anzeigen The sixth International Conference on Cyberworlds (Cyber- worlds 2007) took place in the beautiful town of Hannover, Germany, in October 2007. The HAPTEX Workshop 2007 was co-hosted with the conference. Beschreibungstext verbergen |

Cem Dogan, Laura Doniga-Crivat, Silke Besdo, Franz-Erich Wolter Three-dimensional Biomechanical Models for the Middle and Inner Ear 3 217 2007 Beschreibungstext anzeigen The human peripheral auditory system is divided into the outer, middle and inner ear. The acoustic signal innervates the eardrum. The ossicles carry the signal forward to the inner ear. The system of the three ossicles transforms the acoustic signal. Another function of the middle ear is to protect the inner ear against loud noise. In the inner ear, the structure being responsible for hearing is the cochlea. It incorporates the organ of Corti containing the sensory cells that perform the transduction from mechanical excitation into auditory nerve signals. The cochlear can be described physically by three sections filled with fluid and separated by membranes. One of these is the basilar membrane. Acoustic stimulation by external sound is transformed into traveling waves with amplitude peaks at different places on the basilar membrane depending on the frequency of stimulation. An active mechanism including the outer hair cell somatic electro motility can add energy to the basilar membrane by providing positive feedback to the membrane vibrations. This phenomenon of cochlear amplification results in high sensitivity and increased frequency selectivity of the ear. |

Marc Niethammer, Martin Reuter, Franz-Erich Wolter, Sylvain Bouix, Niklas Peinecke, Min-Seong Ko, Martha E. Shenton Global Medical Shape Analysis using the Laplace-Beltrami-Spectrum 2007 Beschreibungstext anzeigen This paper proposes to use the Laplace-Beltrami spectrum (LBS) as a global shape descriptor for medical shape analysis. The approach allows for shape comparisons using minimal shape preprocessing. In particular, no registration, mapping, or remeshing is necessary. The discriminatory power of the method is tested on a population of female caudate shapes of normal control subjects and of subjects with schizotypal personality disorder. Beschreibungstext verbergen |

D. Allerkamp, G. Böttcher, F.-E. Wolter, A. C. Brady, J. Qu, I. R. Summers A Vibrotactile Approach to Tactile Rendering The Visual Computer 2 97-108 2007 Beschreibungstext anzeigen While moving a fingertip over a fine surface we experience a sensation that gives us an idea of its properties. A satisfactory simulation of this feeling is still an unsolved problem.
In this paper we describe a rendering strategy based on vibrations which play an important role in the tactile exploration of fine surfaces. To produce appropriate excitation patterns we use an array of vibrating contactor pins.
Similar to the colour model in computer graphics we simulate arbitrary vibrations as a superposition of only two sinewaves. Each sinewave is intended for the excitation of a specific population of mechanoreceptors.
We carried out first tests of our rendering strategy on Brownian surfaces of different fractal dimension. Beschreibungstext verbergen |

N. Peinecke, F.-E. Wolter, M. Reuter Laplace Spectra as Fingerprints for Image Recognition Computer-Aided Design 6 460-476 2007 Beschreibungstext anzeigen In the area of image retrieval from data bases and for copyright protection of large image collections there is a growing demand for unique but easily computable fingerprints for images. These fingerprints can be used to quickly identify every image within a larger set of possibly similar images. This paper introduces a novel method to automatically obtain such fingerprints from an image. It is based on a re-interpretation of an image as a Riemannian manifold. This representation is feasible for gray value images and color images. We discuss the use of the spectrum of eigenvalues of different variants of the Laplace operator as a fingerprint and show the usability of this approach in several use cases. Contrary to existing works in this area we do not only use the discrete Laplacian, but also with a particular emphasis the underlying continuous operator. This allows better results in comparing the resulting spectra and deeper insights in the problems arising. We show how the well known discrete Laplacian is related to the continuous Laplace-Beltrami operator. Furthermore we introduce the new concept of solid height functions to overcome some potential limitations of the method. |

2006 |

M. Reuter Laplace Spectra for Shape Recognition 2006 Beschreibungstext anzeigen In dieser Arbeit wird ein Verfahren eingeführt, einen numerischen Fingerabdruck bzw. eine Signatur (die "Shape-DNA") einer beliebigen 2d- oder 3d-Mannigfaltigkeit (Fläche oder Körper) zu berechnen. Hierzu werden die Eigenwerte bzw. das Spektrum des zugehörigen Laplace-Beltrami-Operators ermittelt. Es ist ein neuer Ansatz, dieser Laplace-Beltrami-Spektren als Fingerabdrücke von Flächen und Körpern zu nutzen. Beschreibungstext verbergen |

N. Peinecke Eigenwertspektren des Laplaceoperators in der Bilderkennung Books on Demand GmbH 2006 Beschreibungstext anzeigen In dieser Arbeit wird eine Methode entwickelt, um große Sammlungen von Bildern, vorliegend als aus Pixeln bestehende Grauwert- oder Farbbilder, zu organisieren. Zu diesem Zweck wird jedem Bild ein weitgehend eindeutiger Fingerabdruck, eine Sequenz von Fließkommazahlen, zugeordnet. Diese Sequenz wird aus den Eigenwerten eines zum Bild passenden Laplace-Operators gewonnen, wobei sich Variationen dieser Methode durch die Wahl der Repräsentation des Bildes (als Graph der Höhenfunktion beziehungsweise als Massendichtefunktion) und des Operators (Laplace-Beltrami- beziehungsweise Kirchhoff-Operator) ergeben. Es wird gezeigt, dass die so gewonnenen Fingerabdrücke aufgrund ihrer Herkunft von isometrieinvarianten Operatoren nützliche Eigenschaften für die Erkennung von Bildern haben. Es wird demonstriert, in welchen Situationen dieses Verfahren gut funktioniert, und wann sich jeweils Probleme durch isometrische oder isospektrale Repräsentationen ergeben können. Beschreibungstext verbergen |

M. Reuter, F.-E. Wolter, N. Peinecke Laplace-Beltrami Spectra as Shape DNA of Surfaces and Solids Computer-Aided Design 4 342-366 2006 Beschreibungstext anzeigen This paper introduces a method to extract "Shape-DNA", a numerical fingerprint or signature, of any 2d or 3d manifold (surface or solid) by taking the eigenvalues (i.e. the spectrum) of its Laplace-Beltrami operator. Employing the Laplace-Beltrami spectra (not the spectra of the mesh Laplacian) as fingerprints of surfaces and solids is a novel approach. Since the spectrum is an isometry invariant it is independent of the object's representation including parametrization and spatial position. Additionally the eigenvalues can be normalized, so that uniform scaling factors for the geometric objects can be obtained easily. Therefore, checking if two objects are isometric needs no prior alignment (registration/localization) of the objects but only a comparison of their spectra. In this paper we describe the computation of the spectra and their comparison for objects represented by NURBS or other parametrized surfaces (possibly glued to each other), polygonal meshes as well as solid polyhedra. Exploiting the isometry invariance of the Laplace-Beltrami operator, we succeed in computing eigenvalues for smoothly bounded objects without discretization errors caused by approximation of the boundary. Furthermore, we present two non-isometric but isospectral solids that cannot be distinguished by the spectra of their bodies and present evidence that the spectra of their boundary shells can tell them apart. Moreover, we show the rapid convergence of the heat trace series and demonstrate that it is computationally feasible to extract geometrical data such as the volume, the boundary length and even the Euler characteristic from the numerically calculated eigenvalues. This fact not only confirms the accuracy of our computed eigenvalues, but also underlines the geometrical importance of the spectrum. With the help of this "Shape-DNA" it is possible to support copyright protection, database retrieval and quality assessment of digital data representing surfaces and solids. |

2003 |

K. H. Ko, T. Maekawa, N.M. Patrikalakis, H. Masuda, F.-E. Wolter Shape Intrinsic Properties for Free-Form Object Matching ASME J. Computing and Information Science in Engineering (JCSI) 3 325-333 2003 Beschreibungstext anzeigen This paper presents matching and similarity evaluation meth- ods between two NURBS surfaces, and their application to copyright protection of digital data representing solids or NURBS surfaces. Two methods are employed to match ob- jects: the moment and the curvature methods. The moment method uses integral properties, i.e. the volume, the princi- pal moments of inertia and directions, to find the rigid body transformation as well as the scaling factor. The curva- ture method is based on the Gaussian and the mean cur- vatures to establish correspondence between two objects. The matching algorithms are applied to problems of copy- right protection. A suspect model is aligned to an original model through the matching methods so that similarity be- tween two models can be assessed to determine if the suspect model contains part(s) of the original model, which may be stored in an independent repository. Three types of tests, the weak, intermediate and strong tests, are proposed for similarity assessment between two objects. The weak and intermediate tests are performed at node points obtained through shape intrinsic wireframing. The strong test relies on isolated umbilical points which can be used as finger- prints of an object for supporting an ownership claim to the original model. The three tests are organized in two decision algorithms such that they produce systematic and statistical measures for a similarity decision between two objects in a hierarchical manner. Based on the systematic and statistical evaluation of similarity, a decision can be reached whether the suspect model is an illegal copy of the original model. Beschreibungstext verbergen |

2000 |

F.-E. Wolter , N. M. Patrikalakis Special issue: CGI '98 VISUAL COMPUTER 16 305 Springer 2000 Beschreibungstext anzeigen The Editorialship of the special issue of "The Visual Computer" for the Computer Graphics International 1998. Beschreibungstext verbergen |

F.-E. Wolter , N. M. Patrikalakis Special issue - Computer Graphics International '98 JOURNAL OF VISUALIZATION AND COMPUTER ANIMATION 11 113 Wiley 2000 Beschreibungstext anzeigen The editorial of the special issue of the "Journal of Visualization and Computer Animation" for the Computer Graphics International 1998. Beschreibungstext verbergen |

F.-E. Wolter , N. M. Patrikalakis Special Issue: CGI '98 GRAPHICAL MODELS 62 1 2000 Beschreibungstext anzeigen The editorial of the special issue of "Graphical Models" for the Computer Graphics International 1998. Beschreibungstext verbergen |

1999 |

T. Hermann, G. Lukacs, F.-E. Wolter Geometrical criteria on the higher order smoothness of composite surfaces Computer Aided Geometric Design 9 907-911 1999 Beschreibungstext anzeigen A generalization of a theorem by Pegna and Wolter --- called Linkage Curve Theorem --- is presented. The new theorem provides a condition for joining two surfaces with high order geometric continuity of arbitrary degree n . It will be shown that the Linkage Curve Theorem can be generalized even for the case when the common boundary curve is only G1 . Beschreibungstext verbergen |

1997 |

R. Kunze, F.-E. Wolter, T. Rausch Geodesic Voronoi Diagrams on Parametric Surfaces 1997 Beschreibungstext anzeigen In this paper we will extend the concept of Voronoi diagrams to parameterized surfaces where distance between two points is defined as infimum over the length of surface paths connecting these points.
We will present a method to compute Voronoi diagrams on these surfaces. Beschreibungstext verbergen |

1996 |

T. Rausch, F.-E. Wolter, O. Sniehotta Computation of Medial Curves in Surfaces 43-68 1996 Beschreibungstext anzeigen Medial curves considered in this paper may be regarded roughly spoken as the local equidistantial set of certain subarcs of two given border curves.
In contrast to the problem of computing the equidistantial set (which is a global problem) we focus our attention on the related local problem by ignoring the question whether the computed curve consists only of points that are truly equidistantial to both border curves, the latter ones considered in their full range.
In this paper a method for tracing the medial curve of two border curves is presented. This method is based on the numerical solution of a system of differential equations in the parameter space of the considered surface.
It is proven that this system remains regular as long as the medial curve stays away from local points of the border curves. Finally, it is indicated how the concept might be extended in order to trace the focal curve of a given curve on the surface. The techniques here are designed to work on arbitrary regular surfaces where distance has to be understood as geodesic distance. The method however is useful in the planar case, too. Beschreibungstext verbergen |

J. Pegna, F.-E. Wolter Surface curve design by orthogonal projection of space curves onto free-form surfaces 45-52 1996 Beschreibungstext anzeigen A novel technique for designing curves on surfaces is presented. The design specifications for this technique derive from other works on curvature continuous surface fairing. Briefly stated, the technique must provide a computationally efficient method for the design of surface curves that is applicable to a very general class of surface formulations. It must also provide means to define a smooth natural map relating two or more surface curves. The resulting technique is formulated as a geometric construction that maps a space curve onto a surface curve. It is designed to be coordinate independent and provides isoparametric maps for multiple surface curves. Generality ofthe formulation is attained by solving a tensorial differential equation formulated in terms of local differential properties of the surfaces. For an implicit surface, the differential equation is solved in three-space. For a parametric surface the tensorial differential equation is solved in the parametric space associated with the surface representation. This technique has been tested on a broad class of examples including polynomials, splines, transcendental parametric and implicit surface representations. |

E. Sherbrooke, N. M. Patrikalakis, F.-E. Wolter Differential and Topological Properties of Medial Axis Transforms Graphical Models and Image Processing 58 574-592 1996 Beschreibungstext anzeigen The medial axis transform is a representation of an object which has been shown to be useful in design, interrogation, animation, finite element mesh generation, performance analysis, manufacturing simulation, path planning, and tolerance specification. In this paper, the theory of the medial axis transform for 3-D objects is developed. For objects with piecewise C² boundaries, relationships between the curvature of the boundary and the position of the medial axis are developed. For n -dimensional submanifolds of nwith boundaries which are piecewise C² and completely G¹, a deformation retract is set up between each object and its medial axis, which demonstrates that if the object is path connected, then so is its medial axis. Finally, it is proven that path connected polyhedral solids without cavities have path connected medial axes. |

T. Maekawa, F.-E. Wolter, N. M. Patrikalakis Umbilics and Lines of Curvature for Shape Interrogation Computer Aided Geometric Design 13 133-161 1996 Beschreibungstext anzeigen This paper describes a method to extract the generic features of free-form parametric surfaces for shape interrogation. The umbilical points, which are the singular points of the orthogonal net of lines of curvature, have generic features and may act like fingerprints for shape recognition. We investigate the generic features of the umbilics and behavior of lines of curvature which pass through an umbilic on a parametric free-form surface. Our method is based on a coordinate transformation to set the parametric surface in Monge form and on a Taylor expansion to compute the angles of the tangent lines to the lines of curvatures at an umbilic. We also develop a novel and practical criterion which assures the existence of local extrema of principal curvature functions at umbilical points. Finally, numerical experiments illustrate how the generic features of the umbilics can be applied for surface recognition. Beschreibungstext verbergen |

1995 |

S. Abrams, L. Bardis, C. Chryssostomidis, N. M. Patrikalakis, S. Tuohy, F.-E. Wolter, J. Zhou The Geometric Modeling and Interrogation System Praxiteles Journal of Ship Production 11 116-131 1995 Beschreibungstext anzeigen After establishment of design requirements and creation of an initial shape, the design process of free-form shapes should include interrogation and fairing until a desired shape, with appropriate geometric and performance characteristics, is achieved. Afterwards, the quality of the manufactured product can be determined by comparing measured data with the design model. To permit automated design and manufacturing, mathematical methods and algorithms for the creation, interrogation, fairing, and inspection of curves and surfaces have been developed and integrated into a computer system called PRAXITELEs. The general layout of PRAXITELEs, along with a description of design capabilities, is presented. This description covers the areas of input, output, approximation and conversion for data exchange, a summary of some shape creation methods, and a description of some advanced interactive interrogation, fairing, and inspection methods for NURBS curves and surfaces. Examples illustrate some of the features of the system, as applied in the design and inspection of marine propellers. Recommendations for future development of the system are also presented Beschreibungstext verbergen |

1993 |

S. Abrams, L. Bardis, C. Chryssostomidis, A. Clement, R. Jinkerson, N. M. Patrikalakis, F.-E. Wolter Inspection and Feature Extraction of Marine Propellers Journal of Ship Production 9 88-106 1993 Beschreibungstext anzeigen Localization is the process of determining the rigid-body translations and rotations that must be performed on the set of points measured on a manufactured surface to move those points into closest correspondence with the ideal design surface. In unconstrained localization all points have equal effect on the determination of the rigid-body transformation, while constrained localization allows a subset of the points to have stronger influence on the transformation. The measured points are physical points in space obtained by direct measurement of a manufactured marine propeller blade. The ideal design surface is the surface description of the propeller blade provided by the blade designer. Given that the measured blade is manufactured from the design surface description, the localization determines a Euclidean motion that brings the measured points of the manufactured surface as close as possible to the design surface. An additional option is to determine an offset distance, such that the Euclidean motion brings the measured points as close as possible to the offset of the design surface. For this optimization problem the offset distance is a seventh parameter that must be determined in addition to the six parameters of the Euclidean motion. After localization, the offset of the design surface that was determined can be used to extract the gross geometric features of the manufactured blade. These features have important hydrodynamic functions and include the camber surface, section thickness function, pitch, rake, skew, chord length, maximum thickness, maximum camber, and the leading-edge curve. The approximation of the camber surface, which is the basis of most of the remaining features, is an intricate problem relying on an extension of the concept of a Brooks ribbon. It requires the solution of a system of nonlinear differential equations and a complicated error evaluation scheme. Beschreibungstext verbergen |

F.-E. Wolter Cut Locus & Medial Axis in Global Shape Interrogation & Representation 1993 Beschreibungstext anzeigen The cut C A locus of a closed set A in the Euclidean space E is defined as the closure of the set containing all points p which have at least two shortest paths to A .
We present a theorem stating that the complement of the cut locus i.e. E\(C A u A) is the maximal open set in (E\A) where the distance function with respect to the set A is continuously differentiable. This theorem includes also the result that this distance function has a locally Lipschitz continuous gradient on (E\A) .
The medial axis of a solid D in E is defined as the union of all centers of all maximal discs which fit in this domain. We assume in the medial axis case that D is closed and that the boundary d D of D is a topological (not necessarily connected) hypersurface of E . Under these assumptions we prove that the medial axis of D equals that part of the cut locus of d D which is contained in D .
We prove that the medial axis has the same homotopy type as its reference solid if the solid's boundary surface fulfills certain regularity requirements. We also show that the medial axis with its related distance function can be used to reconstruct its reference solid.
We prove that the cut locus of a solid's boundary is nowhere dense in the Euclidean space if the solid's boundary meets certain regularity requirements.
We show that the cut locus concept offers a common frame work lucidly unifying different concepts such as Voronoi diagrams, medial axes and equidistantial point sets. In this context we prove that the equidistantial set of two disjoint point sets is a subset of the cut locus of the union of those two sets and that the Voronoi diagram of a discrete point set equals the cut locus of that point set.
We present results which imply that a non-degenerate C 1 -smooth rational B-spline surface patch which is free of self-intersections avoids its cut locus. This implies that for small enough offset distances such a spline patch has regular smooth offset surfaces which are diffeomorphic to the unit sphere. Any of those offset surfaces bounds a solid (which is homeomorphic to the unit ball) and this solid's medial axis is equal to the progenitor spline surface. The spline patch can be manufactured with a ball cutter whose center moves along the regular offset surface and where the radius of the ball cutter equals the offset distance. Beschreibungstext verbergen |

1992 |

J. Pegna, F.-E. Wolter Geometrical Criteria to Guarantee Curvature Continuity of Blend Surfaces J MECH DESIGN 114 201-210 1992 Beschreibungstext anzeigen Computer Aided Geometric Design (CAGD) of surfaces sometimes presents problems that were not envisioned in classical differential geometry. This paper presents mathematical results that pertain to the design of curvature continuous blending surfaces. Curvature continuity across normal continuous surface patches requires that normal curvatures agree along all tangent directions at all points of the common boundary of two patches, called the linkage curve. The Linkage Curve theorem proved here shows that, for the blend to be curvature continuous when it is already normal continuous, it is sufficient that normal curvatures agree in one direction other than the tangent to a first order continuous linkage curve. This result is significant for it substantiates earlier works in computer aided geometric design. It also offers simple practical means of generating second order blends for it reduces the dimensionality of the problem to that of curve fairing, and is well adapted to a formulation of the blend surface using sweeps. From a theoretical viewpoint, it is remarkable that one can generate second order smooth blends with the assumption that the linkage curve is only first order smooth. The geometric criteria presented my be helpful to the designer since curvature continuity is a technical requirement in hull or cam design problems. The usefulness of the linkage curve theorem is illustrated with a second order blending problem whose implementation will not be detailed here. Beschreibungstext verbergen |

F.-E. Wolter, S.-T. Tuohy Approximation of High-Degree and Procedural Curves 1992 Beschreibungstext anzeigen The objective of this paper is to present an efficient adaptive algorithm to approximate high-degree and procedural continuous parametric curves by integral B-splines. This approximation algorithm covers nonperiodic and periodic curves. The approximation algorithm is motivated and accompanied by an extensive discussion on approximation errors for position and derivatives accuracies. This discussion includes the derivation of local error bounds for position and derivative errors. The practicality and efficiency of the algorithm is demonstrated for a variety if examples in geometric modeling of engineering structures. The approximation algorithm for the curve forms the basis of a similar surface approximation procedure. Beschreibungstext verbergen |

F.-E. Wolter, S.-T. Tuohy Curvature Computations for degenerate surface patches Computer Aided Geometric Design 9 241-270 1992 Beschreibungstext anzeigen This paper presents a method to compute curvatures of a surface patch S obtained from a degenerate representation defined over a rectangular domain. To compute curvatures at a point q in S where the surface representation is degenerate one has to assume that the point set S has a tangent plane and well defined curvatures at the point q where the curvatures are to be computed. Our computation method employs a local height function representation of S in a neighborhood of the point q where the height function h is defined over the tangent plane of S at the point q . In our method the second order partial derivatives of the height function h at q are computed by using second order derivatives of any three surfaces curves on S which end up in q with pairwise linearly independent tangent directions. The curvature entities of S at q are then computed by using the second order partial derivatives of the height function h at q . We also show how the method is extended to compute partial derivatives of any order of the function h at q . For this purpose we show (in Theorem 1) how the partial derivatives up to n th order of a surface at a point q can be computed using derivatives up to order n of n + 1 surface curves emanating from q . We also present a definition of a concept of generalized surface curvatures under weaker assumptions appropriate for degenerate surfaces. Under those weaker assumptions one does not require a locally C ²-smooth height function representation of the surface over the tangent plane at the degenerate point q , nor a locally well defined (single-valued) height function representation of the surface in a neighborhood of the point q . One only needs the existence of a unique local second order approximation of the degenerate surface with a quadratic function defined over the tangent plane at q . The surface curvatures of the corresponding approximating quadratic surface then define the curvatures of the approximated degenerate surface in the contact point q . |

G. A. Kriezis, N. M. Patrikalakis, F.-E. Wolter Topological and Differential-Equation Methods for Surface Intersections Computer Aided Design 24 41-55 1992 Beschreibungstext anzeigen An implicit representation of the intersection of two parametric surface patches is formulated in terms of the zero level set of the oriented distance function of one surface from the other. The topological properties of the vector field defined as the gradient of the oriented distance function (and specifically the concepts of the rotation number of a vector field and the Poincaré index theory) are next used to formulate a condition for the detection of critical points of the filed, which may be used to identify internal loops and singularities of the solution. An adaptive search guided by this condition and direct numerical techniques are used to detect and compute critical points. Tensorial differential equations that rely on the implicit representation of the intersection are then developed, and are used to trace intersection segments. The tracing scheme relies on a characterization procedure for singular points that allows the computation of the tangent directions to the intersection curve at such points. The method also allows the tracing of degenerate intersection between surfaces that have a common tangent plane along the intersection curve. Examples drawn from rational spline surface intersections illustrate the above techniques. Beschreibungstext verbergen |

1979 |

F.-E. Wolter Distance Function and Cut Loci on a Complete Riemannian Manifold 1 92-96 1979 Beschreibungstext anzeigen Contains basic key results results and fundamental ideas on Cut Loci that were the starting point for Wolter's later follow up generalizations in his Ph.D. thesis and in the MIT report focussing on cut loci and medial Axes in the Euclidean case. Beschreibungstext verbergen |

Beiträge in Büchern |

2007 |

F.-E. Wolter, M. Reuter, N. Peinecke Geometric Modeling for Engineering Applications 2007 Beschreibungstext anzeigen A geometric model of an object – in most cases being a subset of the three dimensional space – can be used to better understand the object’s structure or behavior. Therefore data such as the geometry, the topology and other application specific data have to be represented by the model. With the help of a computer it is possible to manipulate, process or display these data.
We will discuss different approaches for representing such an object: Volume based representations describe the object in a direct way, whereas boundary representations describe the object indirectly by specifying its boundary. A variety of different surface patches can be used to model the object’s boundary. For many applications it is sufficient to know only the boundary of an object.
For special objects explicit or implicit mathematical representations can easily be given. An explicit representation is a map from a known parameter space for in- stance the unit cube to 3D-space. Implicit representations are equations or relations such as the set of zeros of a functional with three unknowns. These can be very efficient in special cases. Beschreibungstext verbergen |

2004 |

F.-E. Wolter, N. Peinecke, M. Reuter Geometric Modeling of Complex Shapes and Engineering Artifacts Wiley 2004 Beschreibungstext anzeigen A geometric model of an object - in most cases being a subset of the three dimensional space -- can be used to better understand the object's structure or behaviour. Therefore data such as the geometry, the topology and other application specific data have to be represented by the model. With the help of a computer it is possible to manipulate, process or display these data.
We will discuss different approaches for representing such an object: Volume based representations describe the object in a direct way, whereas boundary representations describe the object indirectly by specifying its boundary. A variety of different surface patches can be used to model the object's boundary. For many applications it is sufficient to know only the boundary of an object.
For special objects explicit or implicit mathematical representations can easily be given. An explicit representation is a map from a known parameter space e.g. the unit cube to 3D-space. Implicit representations are equations or relations such as the set of zeros of a functional with three unknowns. These can be very efficient in special cases.
As an example of volume based representations we will give a brief overview of the voxel representation. We also show how the boundary of complex objects can be assembled by simpler parts e.g. surface patches. These come in a variety of forms: planar polygons, parametric surfaces defined by a map from 2D-space to 3D-space, especially spline surfaces and trimmed surfaces, multiresolutionally represented surfaces, e.g. wavelet-based surfaces and surfaces obtained by subdivision schemes.
In a boundary representation only the boundary of a solid is described. This is usually done by describing the boundary as a collection of surface patches attached to each other at outer edges. One of the (topologically) most complete schemes is the half-edge data structure as described by Mäntylä. Simple objects constructed via any of the methods above can be joined to build more complex objects via Boolean operators (constructive solid geometry, CSG). Constructing an object one has to assure that the object is in agreement with the topological requirements of the modeling system. Notoriously difficult problems are caused by the fact that most modeling systems can compute surface intersections only with a limited precision. This yields numerical results that may finally cause major errors e.g. topologically contradictory conclusions.
The rather new method of "Medial Modeling" is also presented. Here an object is described by its medial axis and an associated radius function. The medial axis itself is a collection of lower dimensional objects, i.e. for a 3D-solid a set of points, curves and surface patches. This medial modeling concept developed at the Welfenlab yields a very intuitive user interface useful for solid modeling, and also gives as a by-product a natural meshing of the solid for FEM computations.
Additional attributes can be attached to an object, i.e. attributes of physical origin or logical attributes. Physical attributes include photometric, haptical and other material properties, such as elasticity or roughness. Physical attributes are often specified by textures, i.e. functions that relate surface points to certain quantities of the attribute. The most common use for these are photometric textures, although they can also be used for roughness etc. Logical attributes relate the object to its (data-)environment. They can e.g. group objects which are somehow related, or they can associate scripts to the object, such as callbacks for user interactions. Beschreibungstext verbergen |

Beiträge in Tagungsbänden |

2009 |

Wolfgang Mathis, Philipp Blanke, Martin Gutschke, Franz-Erich
Wolter Nonlinear Electric Circuit Analysis from a Differential Geometric Point of View. 15th edition of the International Symposium on Theoretical Electrical Engineering (ISTET'09) 2009 Beschreibungstext anzeigen Theoretical aspects of circuit equations from a differential geometric point of view are considered and methods for solving circuit equations by means of algorithms from computational differential geometry are presented. These methods are illustrated by means of some simple circuit examples. Beschreibungstext verbergen |

Wolfgang Mathis, Philipp Blanke, Martin Gutschke, Franz-Erich Wolter Analysis of Jump Behavior in Nonlinear Electronic Circuits Using Computational Geometric Methods. 2nd International Workshop on Nonlinear Dynamics and Synchronization (INDS 2009) 2009 Beschreibungstext anzeigen In this work we describe the behavior of electrical circuits by a mixture of algebraic and differential equations. We show how to use a geometric interpretation and geometric algorithms to explicitly compute operation points for a special class of electronic circuits. To that end, we discuss how to trace curves on folded manifolds. Beschreibungstext verbergen |

Guido Böttcher, Rasmus Buchmann, Maximilian Klein, Franz-Erich Wolter Aufbau eines VR-Systems zur multimodalen Interaktion mit komplexen physikalischen Modellen 6. Workshop der GI-Fachgruppe VR/AR 2009 Beschreibungstext anzeigen Wir stellen ein neuartiges, semi-immersives VR-System vor, welches neben visuellem auch haitisches Feedback in einem grossen Arbeitsbereich ermöglicht.
Stichworte: VR-System, Haptik, verteilte Systeme Beschreibungstext verbergen |

2008 |

Karl-Ingo Friese, Marc Herrlich, Franz-Erich Wolter Using Game Engines for Visualization in Scientific Applications New Frontiers for Entertainment Computing 2008 Beschreibungstext anzeigen In recent years, the computer gaming industry has become a large and
important market and impressive amounts of money are spent on the development of new game engines. In contrast to their development costs, the price for the final product is very low compared to a professional 3D visualization/animation program. The idea to use this potential for other purposes than gaming seems obvious. This work gives a review on three Serious Gaming projects, analyzes the encountered problems in a greater context and reflects the pros and cons of using game engines for scientific applications in general. Beschreibungstext verbergen |

2007 |

Reuter, Martin; Niethammer, Marc; Wolter, Franz-Erich; Bouix, Sylvain; Shenton, Martha Global Medical Shape Analysis Using the Volumetric Laplace Spectrum in Proceedings of NASAGEM, Hannover, 26th October 2007. 2007 Beschreibungstext anzeigen This paper proposes to use the volumetric Laplace spectrum as a global shape descriptor for medical shape analysis. The approach allows for shape comparisons using minimal shape preprocessing. In particular, no registration, mapping, or remeshing is necessary. All computations can be performed directly on the voxel representations of the shapes.
The discriminatory power of the method is tested on a population of female caudate shapes (brain structure) of normal control subjects and of subjects with schizotypal personality disorder. The behavior and properties of the volumetric Laplace spectrum are discussed extensively for both the Dirichlet and Neumann boundary condition showing advantages of the Neumann spectra. Both, the computations of spectra on 3D voxel data for shape matching as well as the use of the Neumann spectrum for shape analysis are completely new. Beschreibungstext verbergen |

Guido Böttcher, Dennis Allerkamp, Franz-Erich Wolter Virtual reality systems modelling haptic two-finger contact with deformable physical surfaces in Proceedings of HAPTEX '07, Hannover, 23th October 2007 2007 Beschreibungstext anzeigen Real-time cloth simulation involves many computational challenges to be solved, particularly in the context of haptic applications, where high frame rates are necessary for obtaining a satisfying experience. In this paper, we present an interactive cloth simulation system that offers a compromise between a realistic physics-based simulation of fabrics and a haptic application meeting high requirements in terms of computation speed. Our system allows the user to interact with the fabric using two fingers. The required performance of the system is achieved by introducing an intermediate layer responsible for the simulation of the small section of the surface being in contact with the fingers. We compare several contact models to obtain the best compromise in the context of haptic applications. Beschreibungstext verbergen |

Nadia Magnenat-Thalmann, Pascal Volino, Ugo Bonanni, Ian R. Summers, Massimo Bergamasco, Fabio Salsedo, Franz-Erich Wolter From the physics-based simulation to the touching of textiles: The project Haptex in Proceedings of the ICEC 2007, Invited Paper. 2007 Beschreibungstext anzeigen While the animation and rendering techniques used in the domain of textile simulation have dramatically evolved during the last two decades, the ability to manipulate and modify virtual textiles intuitively using dedicated ergonomic devices has been definitely neglected. The project HAPTEX combines research in the field of textile simulation and haptic interfaces. HAPTEX aims to provide a virtual reality system allowing for multipoint haptic interaction with a piece of virtual fabric simulated in real-time. The fundamental research undertaken by the project ranges from the physics-based simulation of textiles to the design and development of novel tactile and force-feedback rendering strategies and interfaces. |

Marco Fontana, Simone Marcheschi, Federico Tarri, Fabio Salsedo, Massimo Bergamasco, Dennis Allerkamp, Guido Böttcher, Franz-Erich Wolter, Alan C. Brady, Jianguo Qu, Ian R. Summers Integrating Force and Tactile Rendering Into a Single VR System in Proceedings of HAPTEX '07, Hannover, 23rd October 2007 2007 Beschreibungstext anzeigen The EU funded RTD project "HAPTEX" addresses the challenge of developing a Virtual Reality (VR) system for the realistic and accurate rendering of the physical interactions of humans with textiles, through the real-time generation of artificial visual and haptic stimuli. This challenge concerns the development of both the SW and the HW components of the VR system, as well as it implies a substantial advancement in the understanding of the mechanisms underlying the human haptic perception of fine physical properties like those of textiles.
This paper reports some important details relating to the technical implementation of the developed HW and SW components with special emphasis on the issues related to their integration into a single VR system. Furthermore some preliminary results relating to the functional tests carried out on the integrated system are also reported. Beschreibungstext verbergen |

Niklas Peinecke, Dennis Allerkamp, Franz-Erich Wolter Generating Tactile Textures using Periodicity Analysis in Proceedings of HAPTEX '07, Hannover, 23rd October 2007 2007 Beschreibungstext anzeigen In this work we present an approach to generate a tactile representation from an image that may be a photograph or a scan of cloth. A large class of fabrics can be generated by repetition of a parallelogram primitive. That means there are two non-collinear directions where the pattern is periodically repeated. The method we present is based on analysing the repetitive structure of the sample, that is to find the two principle directions of repetition, and building a model from that analysis. We compare our method to a technique developed by Gang Huang. Beschreibungstext verbergen |

Henning Naß, Franz-Erich Wolter, Cem Dogan, Hannes Thielhelm Medial Axis Inverse Transform in Complete 3-Dimensional Riemannian Manifolds in Proceedings of NASAGEM, Hannover, 26th October 2007 2007 Beschreibungstext anzeigen The main contribution of this work is the generalization of the Medial Axis Transform (MAT) and the Medial Axis Inverse Transform MAIT) to complete Riemannian manifolds.
It is known that almost every solid can be reconstructed from its medial axis and the corresponding radius function. In the past this reconstruction scheme has only been implemented in Euclidean spaces. We use the concept of Fermi coordinates that represent a natural generalization of conventional coordinates. However, this concept only works out properly if some substantial conditions for the radius function are established.
Several approaches for the computation of the medial axis have been implemented so far but almost all of them lack good numerical results. Usually numerical errors occur because the approaches operate on a discretised model of the corresponding objects. In this work we will assume that both the 3D Riemannian space and the modelled object can be represented by smooth mappings and coordinate charts respectively. Therefore, we can introduce the so called medial equations that will allow us to compute medial surface patches using the implicit function theorem.
Finally we will give examples for the MAT and the MAIT and show to what extent the inverse transform is applicable in the context of Computer Aided Geometric Design. The Geodesic Medial Modeller is one of those applications.
Beschreibungstext verbergen |

Henning Naß, Franz-Erich Wolter, Cem Dogan, Hannes Thielhelm Computation of Geodesic Voronoi Diagrams in 3-Space using Medial Equations in Proceedings of NASAGEM, 26th October 2007 2007 Beschreibungstext anzeigen The Voronoi diagram has been investigated intensively throughout the last decades. This has been done not only in the context of Euclidean geometry but also in curved spaces. Most methods typically make use of some fast marching cube algorithms. In this work we will focus on the computation of Voronoi diagrams including Voronoi objects that are contained in a Riemannian manifold with a differentiable structure.
Our approach relies on the precise computation of shortest joins of any two given points on the manifold. For these computations we did not apply shooting or related methods. Instead, we used a new perturbation method that operates on a family of deformed manifolds. To reduce time and space complexity we suggest to use a randomised incremental construction scheme (RICS). In this work, we also present several examples of Voronoi diagrams computed with our method. Beschreibungstext verbergen |

Niklas Peinecke, Franz-Erich Wolter Mass Density Laplace-Spectra for Image Recognition in Proceedings of NASAGEM, Hannover, 26th October 2007 2007 Beschreibungstext anzeigen Modern multimedia applications generate vast amounts of image data. With the availability of cheap photo hardware and affordable rendering software even more such data is being collected. In order to manage huge collections of image data one needs short representations of the data sets, or to be more precise invariant features being appropriate to identify a specific voxel data set using just a few numbers.
This paper describes a variation of a method introduced by Reuter, Wolter and Peinecke based on the computation of the spectrum of the Laplace operator for the image for generating an invariant feature vector - a fingerprint. Opposed to previous techniques interpreting the image as a height function we make use of the representation of the image as a density function.
We discuss the use of the spectrum of eigenvalues of the Laplace mass density operator as a fingerprint and show the usability of this approach in several cases. Instead of using the discrete Laplace-Kirchhoff operator the approach presented in this paper is based on the continuous Laplace operator allowing better results in comparing the resulting spectra and deeper insights into the problems arising when comparing two spectra generated using discrete Laplacians. Beschreibungstext verbergen |

Philipp Blanke, Franz-Erich Wolter Fast Inverse Forging Simulation via Medial Axis Transform in Proceedings of NASAGEM, Hannover, 26th October 2007 2007 Beschreibungstext anzeigen Hot metal forging and precision-forging of machine parts are important production techniques. Forging processes generally consist of several steps and have to be designed from top down. Beginning with the final product, the design engineer derives the intermediate steps of the process in inverse order, using simulations to evaluate and validate them. The simulations are generally based on the finite element method, a widely employed technique in engineering. Two problems exist with this method:
1. The run-time of the simulations is often very long, depending on the spatial and temporal resolution of the simulated process.
2. The simulation progresses from one intermediate step to the next, while the engineer has to lay out the steps in inverse order.
We propose a technique which adresses these problems, by following an approach relying on the geometry of the form and elementary plasticity theory. This method allows for a coarse approximation of the material flow that can be inverted. Beschreibungstext verbergen |

2005 |

M. Reuter, F.-E. Wolter, N. Peinecke Laplace-Spectra as Fingerprints for Shape Matching Proceedings of the ACM Symposium on Solid and Physical Modeling (http://www.solidmodeling.org/spm.html) 2005 Beschreibungstext anzeigen This paper introduces a method to extract fingerprints of any surface or solid object by taking the eigenvalues of its respective Laplace-Beltrami operator. Using an object's spectrum (i.e. the family of its eigenvalues) as a fingerprint for its shape is motivated by the fact that the related eigenvalues are isometry invariants of the object. Employing the Laplace-Beltrami spectra (not the spectra of the mesh Laplacian) as fingerprints of surfaces and solids is a novel approach in the field of geometric modeling and computer graphics. Those spectra can be calculated for any representation of the geometric object (e.g. NURBS or any parametrized or implicitly represented surface or even for polyhedra).
Since the spectrum is an isometry invariant of the respective object this fingerprint is also independent of the spatial position. Additionally the eigenvalues can be normalized so that scaling factors for the geometric object can be obtained easily. Therefore checking if two objects are isometric needs no prior alignment (registration / localization) of the objects, but only a comparison of their spectra. With the help of such fingerprints it is possible to support copyright protection, database retrieval and quality assessment of digital data representing surfaces and solids. Beschreibungstext verbergen |

P. Volino, P. Davy, U. Bonanni, N. Magnenat-Thalmann, G. Böttcher, D. Allerkamp, F.-E. Wolter From measured physical parameters to the haptic feeling of fabric Proceedings of the HAPTEX'05 Workshop on Haptic and Tactile Perception of Deformable Objects (peer-reviewed), Hanover, pp. 17-29. December 2005. 2005 Beschreibungstext anzeigen Real-time cloth simulation involves many computational challenges to be solved, particularly in the context of haptic applications, where high frame rates are necessary for obtaining a satisfactory tactile experience.In this paper, we present a realtime cloth simulation system which offers a compromise between a realistic physically based simulation of fabrics and a haptic application with high requirements in terms of computation speed. We give emphasis on architecture and algorithmic choices for obtaining the best compromise in the context of haptic applications. A first implementation using a haptic device demonstrates the features of the proposed system and leads to the development of new approaches for the haptic rendering using the proposed approach. Beschreibungstext verbergen |

F. Salsedo, M. Fontana, F. Tarri, E. Ruffaldi, M. Bergamasco, N. Magnenat-Thalmann, P. Volino, U. Bonanni, A. Brady, I. Summers, J. Qu, D. Allerkamp, G. Böttcher, F.-E. Wolter, M. Makinen, H. Meinander Architectural Design of the Haptex System Proceedings of the HAPTEX'05 Workshop on Haptic and Tactile Perception of Deformable Objects (peer-reviewed), Hanover, pp. 17-29, December 2005. 2005 Beschreibungstext anzeigen This paper reports the preliminary results of the architectural design of the HAPTEX system that will be developed in the framework of the IST FET (Future and Emerging Technologies)
initiative. The aim of the EU funded RTD project is to realize a virtual reality system able to render, visually and haptically, the behavior of fabrics.
The integration of force-feedback devices with tactile arrays is foreseen to reproduce both
kinesthetic and tactile stimulations. A multilayer-multithread architecture has been selected in order to optimize the computational speed and to achieve a sufficient refresh rate for real-time
applications. Beschreibungstext verbergen |

2003 |

K. H. Ko, T. Maekawa, N. M. Patrikalakis, H. Masuda, F.-E. Wolter Shape Intrinsic Fingerprints for Free-Form Object Matching Proceedings of the Eighth ACM Symposium on Solid Modeling and Applications. G. Elber and V. Shapiro, editors. pp. 196-207. Seattle, WA, June 2003. 2003 Beschreibungstext anzeigen This paper presents matching and similarity evaluation methods between two NURBS surfaces, and their application to copyright protection of digital data representing solids or NURBS surfaces. Two methods are employed to match objects: the moment and the curvature methods. The moment method uses integral properties, i.e. the volume, the principal moments of inertia and directions, to find the rigid body transformation as well as the scaling factor. The curvature method is based on the Gaussian and the mean curvatures to establish correspondence between two objects. The matching algorithms are applied to problems of copyright protection. A suspect model is aligned to an original model through the matching methods so that similarity between two models can be assessed to determine if the suspect model contains part(s) of the original model, which may be stored in an independent repository. Three types of tests, the weak, intermediate and strong tests, are proposed for similarity assessment between two objects. The weak and
intermediate tests are performed at node points obtained through shape intrinsic wireframing. The strong test relies on isolated umbilical points which can be used as fingerprints of an object for supporting an ownership claim to the original model. The three tests are organized in two decision algorithms such that they produce systematic and statistical measures for a similarity decision between two objects in a hierarchical manner. Based on the systematic and statistical evaluation of similarity, a decision can be reached whether the suspect model is an illegal copy of the original model. Beschreibungstext verbergen |

K. H. Ko, T. Maekawa, N. M. Patrikalakis, H. Masuda, F.-E. Wolter Shape Intrinsic Watermarks for 3D Solids Proceedings of the 2003 NSF Design, Service and Manufacturing Grantees and Research Conference, Birmingham, Alabama, January 2003. 2003 Beschreibungstext anzeigen Recently copyright issues for digital contents are becoming a serious problem. Especially when the copyrighted digital contents are exposed to the internet, they are an easy target for malicious parties to produce pirate digital contents for unauthorized sales. Digital watermarking, defined as a process to embed data called watermark into a digital content to protect the copyright of the owners, is becoming an active research topic. There exist studies on digital watermarking techniques for 3D polygonal models, prompted by the increasing popularity of virtual reality modeling language (VRML) and standardization of MPEG-4. Unfortunately, these techniques cannot be applied directly to computer aided design (CAD) based objects, which are usually represented by Non-Uniform Rational B-Spline (NURBS) surfaces. Moreover existing watermarking techniques, such as embedding data by slightly changing the control points, putting some pattern in the mesh, are vulnerable to coordinate transformation, random noise and malicious action of the user. The objective of this project is to develop an intrinsic watermark technique for solids bounded by NURBS surfaces. The key idea is to extract intrinsic properties of solids, which are not affected by coordinate transformations, random noise and malicious action of the user. This watermark can be destroyed only if the digital model describing the shape is changed so much that the newly represented object cannot any longer be considered approximately identical to the original solid in the database. Beschreibungstext verbergen |

Karl-Ingo Friese, Roland Hachmann, Franz-Erich Wolter Content Management Systeme in der Landschaftsplanung 8. internationales Symposion zur Rolle der Informationstechnologien in der und für die Planung sowie zu den Wechselwirkungen zwischen realem und virtuellem Raum, CORP 2003 2003 Beschreibungstext anzeigen Der Einsatz neuer Medien gewinnt auch in der Landschaftsplanung immer mehr an Bedeutung. Dabei ist es wichtig, dass unterschiedliche Projektbeteiligte (z.B. Gemeinden, Verbände, Fachplanungen, etc.) über eine Schnittstelle Zugriff auf gemeinsame Daten erhalten. Im Rahmen eines von der Deutschen Bundesstiftung Umwelt (DBU) geförderten und Mitte 2002 abgeschlossenen Forschungsprojektes wurde am Institut für Landschaftspflege und Naturschutz der Universität Hannover zusammen mit weiteren Projektpartnern eine Informations- und Kommunikationsplattform im Internet aufgebaut. Die positiven aber auch negativen Erfahrungen fliessen in ein weiteres, durch das Bundesamt für Naturschutz (BfN) gefördertes Erprobungs- und Entwicklungsvorhaben, den sogenannten "interaktiven Landschaftsplan" ein.
In beiden Vorhaben handelt es sich um unterschiedlichste Nutzergruppen, die sich in einen Prozess einbringen können und sollen. Als Schnittstelle, die gleichzeitig Fragen des Datenschutzes und der Zugriffsrechte berücksichtigen muss, kommt daher, wie bei fast allen größeren Internetprojekten neueren Datums, ein Content Management System (CMS) zum Einsatz.
Die Erfahrungen aus bereits abgeschlossenen Forschungsprojekten und ein Vergleich freier Public-Domain CMS-Software liessen als Konsequenz nur die Neuentwicklung eines frei verfügbaren Content Management System am Institut für Angewandte Systeme der Universität Hannover zu.
Die Eigenschaften und Möglichkeiten (Nutzer- und Gruppenverwaltung, Bild- und Fotoarchiv, Infobrief, Mailinglisten etc.) des unter dem Arbeitstitel CoMa entwickelten Redaktionssystems und der Dokumentationsbeschreibungssprache CoMaL sollen unter anderem hier aufgezeigt werden. Beschreibungstext verbergen |

2001 |

P. T. Bremer, B. Hamann, O. Kreylos, F.-E. Wolter Simplification of Closed Triangulated Surfaces Using Simulated Annealing Proceedings of the Fifth International Conference on Mathematical Methods for Curves and Surfaces, Oslo, July, 2000. Mathematical Methods in CAGD, pp. 45-54, Vanderbilt University Press, Tennessee 2001. 2001 Beschreibungstext anzeigen We describe a method to approximate a closed surface triangulation using simulated annealing. Our approach guarantees that all vertices and triangles in an approximating surface triangulation are within user-defined distance of the original surface triangulation. We introduce the idea of atomic envelopes to guarantee error bounds that are independent of the surface geometry. Atomic envelopes also allow approximation distance to be different for different parts of the surface. We start with the original triangulation and perturb it randomly and improve an approximating triangulation by locally changing the triangulation, using a simulated annealing algorithm. Our algorithm is not restricted to using only original vertices; the algorithm considers every point inside the envelope triangulation as a possible position. The algorithm attempts to minimize the total number of vertices needed to approximate the original surface triangulation within the prescribed error bound. Beschreibungstext verbergen |

2000 |

F.-E. Wolter, K.-I. Friese Local & Global Geometric Methods for Analysis Interrogation, Reconstruction, Modification & Design of Shape Proceedings of Computer Graphics International 2000, pp. 137-151, Geneva, Switzerland, IEEE Computer Society, June 2000. Invited paper. (Also available as Welfen Laboratory Report No. 3.) 2000 Beschreibungstext anzeigen This paper gives an overview of some recent methods useful for local and global shape analysis and for the design of solids.
These methods include as new tools for global and local shape analysis the Spectra of the Laplace and the Laplace-Beltrami Operator and the Concept of stable Umbilical Points i.e. stable singularities of the principal curvature line wire frame model of the solid's boundary surface.
Most material in this paper deals with the Medial Axis Transform as a tool for shape interrogation, reconstruction, modification and design. We show that it appears to be possible to construct an intuitive user interface that allows to mould shape employing the Medial Axis Transform.
We also explain that the Medial Axis and Voronoi Diagrams can be defined and computed as well on free form surfaces in a setting where the geodesic distance between two points p, q on a surface S is defined by the shortest surface path on S joining the two points p, q .
This leads to the natural and computable generalized concepts of geodesic Medial Axis and geodesic Voronoi Diagram on free form surfaces. Both can be computed with a reasonable speed and with a high accuracy (of about 12 digits when double floating point arithmetic is used for the computations). Beschreibungstext verbergen |

1999 |

M. Bergmann, I. Herbst, R. v. Wieding, F.-E. Wolter Haptical Rendering of Rough Surfaces using their Fractal Dimension Proceedings of the First PHANToM Users Research Symposium, pp.9-12, May 21-22, 1999, German Cancer Research Center, Heidelberg, Germany 1999 Beschreibungstext anzeigen The purpose of our project is to use roughness dependent information of a given 2D-texture for haptic rendering. A well-known fact in the area of Computer Graphics states a strong correlation of surface roughness and its fractal dimension. Basically we pursue two approaches to generate haptical impression of roughness after estimating the fractal dimension Dfrac of a given texture. These approaches are based on Brownian surfaces and motions. The textures in question have to be available in an appropriate representation applied to computed Dfrac . Beschreibungstext verbergen |

1993 |

S. L. Abrams, L. Bardis, N. M. Patrikalakis, S. T. Tuohy, F.-E. Wolter Numerical Experiments in Surface Approximation with Degree Reduction 1993 Beschreibungstext anzeigen To facilitate the accurate exchange of geometric data between different modeling systems, the approximate conversion of high degree B-spline or procedurally defined geometries to lower degree representations is required. We briefly review the algorithms we have developed to approximate high order and procedurally defined bivariate functions with integral B-splines. We also provide a test numerical example to permit comparison with alternative methods. The approximation algorithm used in this example is based on an iterative scheme in which the approximation error is estimated by adaptive sampling and is reduced through adaptive knot addition. For the approximation of high order polynomials, the effectiveness of a global error bound using convex hulls is also illustrated. Beschreibungstext verbergen |

1990 |

J. Pegna, F.-E. Wolter Designing and Mapping Trimming Curves on Surfaces Using Orthogonal Projection Proceedings of the 15th ASME Design Automation Conference: Advances in Design Automation 1990 Beschreibungstext anzeigen In the design and manufacturing of shell structures it is frequently necessary to construct trimming curves on surfaces. The novel method introduced in this paper was formulated to be coordinate independent and computationally efficient for a very general class of surfaces. Generality of the formulation id attained by solving a tensorial differential equation that is formulated in terms of local differential properties of the surface.
In the method proposed here, a space curve is mapped onto the surface by tracing a surface curve whose points are connected to the space curve via surface normals. This surface curve is called to be an orthogonal projection of the space curve onto the surface. Tracing of the orthogonal projection is achieved by solving the aforementioned tensorial differential equation. For an implicitly represented surface, the differential equation is solved in three-space. For a aprametric surface, the tensorial differential equation is solved in the parametric space associated with the surface representation. This method has been tested on a broad class of examples including polynomials, splines, transcendental parametric and implicit surface representations.
Orthogonal projection of a curve onto a surface was also developed in the context of surface blending. The orthogonal projection of a curve onto two surfaces to beblended provides not only a trimming curve design tool, but it was also used to construct smooth natural maps between trimming curves on different surfaces. This provides a coordinate and representation independent tool for constructing blend surfaces. Beschreibungstext verbergen |

1989 |

J. Pegna, F.-E. Wolter A Simple Practical Criterion to Guarantee Second Order Smoothness of Blend Surfaces Proceedings of the 15th ASME Design Automation Conference: Advances in Design Automation. 1989 Beschreibungstext anzeigen Computer Aided Geometric Design of surfaces sometimes presents problems, that were not envisioned by mathematicians in differential geometry. This paper presents mathematical results that pertain to the design of second order smooth blending surfaces. Second order smoothness normally requires that normal curvatures agree along all tangent directions at all points of the common boundary of the patches, called the linkage curve. The Linkage Curve Theorem proved here shows that, for the blend to be second order smooth when it already is first order smooth, it is sufficient, that normal curvatures agree in one direction other than the tangent to a first order continuous linkage curve. This result is significant for it substantiates earlier works in computer aided design. It also offers simple practical means of generating second order blends for it reduces the dimensionality of the problem to that of curve fairing, and is well adapted to a formation of the blend surface using sweeps. From a theoretical viewpoint, it is remarkable that one can generate second order smooth blends with the assumption that the linkage curve is only first order smooth. This property may be helpful to the designer, since linkage curves can be constructed from low order piecewise continuous curves.
Beschreibungstext verbergen |

Diplom-/ Masterarbeiten |

1979 |

F.-E. Wolter Interior Metric, shortest paths and loops in Riemannian manifolds with not necessarily smooth boundary Freie Universität Berlin 1979 Beschreibungstext anzeigen In a metric space with an interior metric the distance between any two points is realized by the infinimum of the lengths of all paths joining those two points. In this space the length of a continuous parameterized path is defined by the supremum of all sums built by distances between any two consecutive points corresponding to any partition of the parameterization interval of the path. For locally compact and (Cauchy) complete metric space with an interior metric there exists for any two points a shortest path joining those points and (the assumption of an interior metric assures that) the length of the shortest path equals the metric distance between the end points of that path.
In case the latter metric space is not simply connected then there exists a shortest path in any homotopy class of closed paths with fixed base point. If further more the latter metric space is compact then there exists a closed shortest path in any non trivial free homotopy class of closed paths. Complete Riemannian manifolds provide classical examples for spaces with an interior metric where any two points can be joined by a shortest path realizing the distance between the two points. The main subject of this thesis are shortest paths in Riemannian manifolds that may have a boundary that is not necessarily smooth .
Let M be an n-dimensional Riemannian manifold with or without boundary. If the boundary of M is not empty then we assume that M is a topological manifold whose boundary is an (n-1)-dimensional topological manifold. Furthermore we assume that any point in M has a neighborhood containing a set being C¹-diffeomorphic to a cone in the n-dimensional Euclidean space. If the latter manifold M carries a (merely) continuous Riemannian metric then it can be employed to define the length of piece wise C¹-smooth paths useful to define the distance between any two given points in M. This distance endows M with an interior metric s. o. whose topology agrees with the manifold topology of M.
We assume now that the Riemannian metric is locally Lipschitz continuous and that every point of M has a neighborhood being C¹ diffeomorphic to a convex set in Euclidean space. Then an arclength parameterized shortest path joining any two points in M has an absolutely continuous first derivative and the square of the second derivative is Lebesgue integrable. This implies that the aforementioned first derivative is Hoelder-1/2-continuous. Combining the latter results with the general existence results for shortest paths stated above then we obtain:
If a Riemannian manifold M is locally C¹ diffeomorphic to some convex set in the Euclidean space and if M carries a locally Lipschitz continuous Riemannian metric then M becomes a metric space with an interior metric. If the latter metric space is complete then any two points p, q in M can be joined by a shortest C¹-smooth path whose length realizes the metric distance between p and q. The first derivative of that shortest path is Hoelder-1/2-continuous as the square of its second derivative is Lebesgue integrable. Furthermore there exists a shortest path in any homotopy class of closed paths with fixed base point. An arc length parameterization of the latter path is C¹-smooth and has all the aforementioned continuity properties. Note that at the base point (being the starting point and the end point) of the closed shortest path there usually exist two distinct tangent directions related to the start and the end point (respectively) of the parameterized shortest path.
Under the additional assumption that the space M is compact we have in any (non trivial) free homotopy class of closed paths a shortest path that is C¹ smooth everywhere. This means now at any point chosen as start and end point of (the aforementioned) closed path the tangent directions at the start point and at the end point agree. This implies if M is not simply connected and compact then there exists a shortest non contractible closed path (loop) and that path is C¹ smooth everywhere having the same derivative at the beginning and the end of the closed path.
The result stated above concerning existence and continuity of shortest (i.e., distance minimal paths) for the space M specified above (with quite weak assumptions) can be employed to prove that on M the distance function d(A, x) describing the distance of a variable point x in M with respect to some closed set A has a continuous gradient outside the cut locus of the set A, if x avoids A, cf. F.- E. Wolter
The aforementioned results imply the respective corresponding classical results that are valid for unbordered Riemannian manifolds, however, the techniques of the proofs are completely different and employ specific variational methods and tools from analysis. Beschreibungstext verbergen |

Verschiedene |

2006 |

German Patent Application, June 2005 (pending), US Patent US2009/0169050 A1, July 2, 2009 F.-E. Wolter, N. Peinecke, M. Reuter Verfahren zur Charakterisierung von Objekten /A Method for the Characterization of Objects (Surfaces, Solids and Images) 2006 Beschreibungstext anzeigen A method for characterization of objects has the steps of: a) describing an object with an elliptical self-adjoint eigenvalue problem in order to form an isometrically invariant model; b) determining eigenvalues of the eigenvalue problem; and c) characterizing the object by the eigenvalues. Beschreibungstext verbergen |

International Patent Application, pending F.-E. Wolter, M. Reuter, N. Peinecke Formoptimierung und effiziente FEM-Berechnung mit Hilfe der Medialen Achse / Shape Optimization and Efficient FEM Computation Employing the Medial Axis 2006 |

2003 |

K. H. Ko, T. Maekawa, N. M. Patrikalakis, F.-E. Wolter, H. Masuda Shape-intrinsic watermarks for 3-D solids, US Pat Appl 20030128209 2003 Beschreibungstext anzeigen Umbilics of two surfaces are compared and it is determined from this comparison whether the suspect surface is a copy of the original surface based on the comparison. Comparing umbilics includes determining whether locations of the umbilics of the suspect surface match within a specified margin umbilics of the original surface, and determining whether pattern types of umbilics of the suspect surface match pattern types of corresponding umbilics of the original surface. A "weak" test may be performed, in which corresponding points on the two surfaces are compared, wherein the comparison of umbilics is performed if corresponding points of the two surfaces are located within a specified margin of each other. The points may be gridpoints on wireframes, which in turn may be based on lines of curvature of the surfaces. Comparing umbilics is performed if it is determined that each surface has at least one umbilic. Further still, an "intermediate" test may be performed which includes, for each surface, computing the principal directions of lines of curvature at each grid point. The computed directions of lines of curvature for corresponding gridpoints on the surfaces are compared. A determination is made as to whether the suspect surface is a copy of the original surface, based on the comparison.
Beschreibungstext verbergen |

Dissertationen |

1985 |

F.-E. Wolter Cut Loci in Bordered and Unbordered Riemannian Manifolds Technical University of Berlin 1985 Beschreibungstext anzeigen If one moves starting from some point on a normalized geodesic in a Riemannian manifold, then it is a natural question: "How long is this geodesic a minimal join to the starting point, e.g. a shortest path joining the points?"
A possibility to answer this question is given with the introduction of the concept of the Cut Locus, which goes back to H. Poincaré and H. von Mangoldt.
The center of our considerations are bordered Riemannian manifolds, where the boundary has the effect of an obstacle. Minimal joins may bifurcate at boundary points. Therefore even very elemental problems concerning regularity and local uniqueness of locally shortest paths are not easy to solve and we meet new problems and new phenomena.
Nonetheless it is yet possible to prove some results for Cut Loci in borderd manifolds and just this is the main intention of our paper.
Several definitions for the cut locus of a closed set in a bordered manifold are given and it is proven, that the complement of the Cut Locus is the maximal set in which the distance function of the set is smoothly differentiable.
Further the concepts of Pica, Extender/Non-Extender and Lipschitz-Point are introduced, which lead to several interesting results about the differentiability of minimal joins and a new prove of Jacobi's Theorem and give a natural frame for certain results concerning EFP-Sets. Beschreibungstext verbergen |

Tagungsbände |

2007 |

International Conference on Cyberworlds 2007 2007 Beschreibungstext anzeigen The proceedings of The CYBERWORLDS 2007, held October 24-27 in Hannover, Germany.
In addition to the 35 papers selected for the October 2007 conference on cyberworlds, this volume also publishes 10 papers from a workshop on modeling virtual reality systems incorporating haptic and tactile feedback and 13 papers from a second workshop on advanced mathematical methods for geometric modeling and shape analysis. The cyberworld papers explore data management, artificial intelligence, cyber ethics, virtual humans, distributed virtual environments, human interaction, and visualization. Other topics include subjective fabric evaluation, anisotropic bending stiffness on particles grids, fast inverse forging simulation via medial axis transform, encoding animated meshes in local coordinates, and parametric reconstruction of bent tube surfaces. Beschreibungstext verbergen |

2005 |

HAPTEX '05 2005 |

1998 |

F.-E. Wolter, N. M. Patrikalakis Proceedings of Computer Graphics International 1998 1998 Beschreibungstext anzeigen These printed proceedings contain most of the papers presented at CGI’98, the 16th Computer Graphics International Conference of the Computer Graphics Society. CGI’98 was held in Hannover, Germany, from June 22 to June 26, 1998, and was the first CGI congress to be held in Germany.
Beschreibungstext verbergen |