Multiple Parameter Continuation: Computing Implicitly Defined k-Manifolds

We present a new continuation method for computing implicitly defined manifolds. The manifold is represented as a set of overlapping neighborhoods, and extended by an added neighborhood of a bounda...

[1]  Jan Awrejcewicz,et al.  Bifurcation and Chaos , 1995 .

[2]  H. Edelsbrunner.  The union of balls and its dual shape , 1995 .

[3]  B. Fox,et al.  Construction of Voronoi Polyhedra , 1978 .

[4]  Franz Aurenhammer,et al.  An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..

[5]  W. Rheinboldt.  On the computation of multi-dimensional solution manifolds of parametrized equations , 1988 .

[6]  Pierre Hansen,et al.  On-line and off-line vertex enumeration by adjacency lists , 1991, Oper. Res. Lett..

[7]  D. S. Mackey,et al.  A new algorithm for two-dimensional numerical continuation , 1995 .

[8]  David P. Dobkin,et al.  Contour tracing by piecewise linear approximations , 1990, TOGS.

[9]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[10]  E. Allgower,et al.  Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .

[11]  E. Allgower,et al.  An algorithm for piecewise lin-ear approximation of implicitly de?ned two-dimensional surfaces , 1987 .

[12]  Paul Ning,et al.  An evaluation of implicit surface tilers , 1993, IEEE Computer Graphics and Applications.

[13]  Mark Hall,et al.  Adaptive polygonalization of implicitly defined surfaces , 1990, IEEE Computer Graphics and Applications.

[14]  E. Allgower,et al.  An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold , 1985 .

[15]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[16]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[17]  Hans G. Othmer,et al.  THE DYNAMICS OF COUPLED CURRENT-BIASED JOSEPHSON JUNCTIONS — PART II , 1991 .

[18]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[19]  Ulrich Betke,et al.  Finite Packings of Spheres , 1998, Discret. Comput. Geom..

[20]  W. Rheinboldt.  On a Moving-Frame Algorithm and the Triangulation of Equilibrium Manifolds , 1987 .

[21]  László Fejes Tóth.  Minkowski Circle Packings on the Sphere , 1999, Discret. Comput. Geom..

[22]  Werner C. Rheinboldt,et al.  On the Computation of Simplical Approximations of Implicitly Defined Two-Dimensional Manifolds. , 1994 .

[23]  Jacques Cohen,et al.  Two Algorithms for Determining Volumes of Convex Polyhedra , 1979, JACM.

[24]  Mark Levi,et al.  THE GEOMETRY AND COMPUTATION OF THE DYNAMICS OF COUPLED PENDULA , 1991 .

[25]  Franz Aurenhammer,et al.  Improved Algorithms for Discs and Balls Using Power Diagrams , 1988, J. Algorithms.

[26]  Hiroshi Imai,et al.  Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..