Magnetism and Minimal Surfaces - a Different Tool for Surface Design

The design of free form surfaces is usually based on NURBS and it works well to quickly get shapes that a designer intends to create. Such surfaces then have desired properties like given border lines and C1 or C2 continuity along lines where several surfaces touch. Our approach is to create surfaces with certain physical properties that designers often need. Given a closed or not closed border line, can we then find an elastic surface (comparable with a rubber surface) with the property requiring that in each point the tension is equally distributed? This is – simplified spoken – the condition for a minimal surface. Our solution does not use any differential equations but rather the following idea: We start from a patch that may be planar or part of a cylinder or any easy to define surface. This patch is tesselated in such a way that the vertices have roughly equal distances. Each point is considered to be magnetic. Now we start a converging real-time-iteration that allows the points to move according to the rules of magnetism. Border lines or parts of them may be fixed and manipulated. The corresponding algorithm is adapted from earlier algorithms by Fruchterman et al. The result is an approximation to a minimal surface that is defined by the fixed border lines. The advantage of such a surface design is twofold: First, the problem is hard to solve exactly by means of differential equations, and second the algorithm works interactively in real time. This means that the designer can change shapes almost as quickly as with conventional free form surfaces. Finally, the surface is already suitably triangulated.

[1]  Michael E. Taylor,et al.  Differential Geometry I , 1994 .

[2]  Carlo H. Séquin,et al.  Functional optimization for fair surface design , 1992, SIGGRAPH.

[3]  Hans-Peter Schröcker,et al.  Handbook of Geometric Programming Using Open Geometry GL , 2002, Springer New York.

[4]  Johannes Wallner,et al.  Fair webs , 2006, The Visual Computer.

[5]  Hlawka Ebene Kinematik , 1941 .

[6]  W. Wunderlich Über ein abwickelbares Möbiusband , 1962 .

[7]  Jörg Peters,et al.  Local smooth surface interpolation: a classification , 1990, Comput. Aided Geom. Des..

[8]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[9]  Johannes Wallner,et al.  On Surface Approximation Using Developable Surfaces , 1999, Graph. Model. Image Process..

[10]  H. Brauner Lehrbuch der konstruktiven Geometrie , 1986 .

[11]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[12]  Georg Glaeser,et al.  Efficient Volume-Generation During the Simulation of NC-Milling , 1997, VisMath.

[13]  Georg Glaeser Geometrie und ihre Anwendungen - in Kunst, Natur und Technik , 2005 .

[14]  Helmut Pottmann,et al.  Developable rational Bézier and B-spline surfaces , 1995, Comput. Aided Geom. Des..

[15]  Descriptive Geometry Meets Computer Vision – The Geometry of Two Images , .

[16]  J. Mitani,et al.  Making papercraft toys from meshes using strip-based approximate unfolding , 2004, SIGGRAPH 2004.

[17]  Erwin Kruppa Analytische und konstruktive Differentialgeometrie , 1957 .

[18]  Gerald Farin,et al.  Curves and surfaces for cagd , 1992 .

[19]  Josef Hoschek,et al.  Approximation of surfaces of revolution by developable surfaces , 1998, Comput. Aided Des..

[20]  Marc Pollefeys,et al.  Multiple view geometry , 2005 .

[21]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .