The monodromy of a series of hypersurface singularities.
This paper studies the smoothness and the curvature of conflict sets of the distance function in the plane. Conflict sets are also well known as 'bisectors'. We prove smoothness in the case of two convex sets and give a formula for the curvature. We generalize moreover to weighted distance functions, the so-called Johnson-Mehl model.
Lines on hypersurfaces with isolated singularities are classified. New normal forms of simple singularities with respect to lines are obtained. Several invariants are introduced.
We describe the structure of minimal round functions on compact closed surfaces and three-dimensional manifolds. The minimal possible number of critical loops is determined and typical non-equisingular round function germs are interpreted in the spirit of isolated line singularities. We also discuss a version of Lusternik-Schnirelmann theory suitable for round functions.
This article extends to three dimensions results on the curvature of the conflict curve for pairs of convex sets of the plane, established by Siersma [3]. In the present case a conflict surface arises, equidistant from the given convex sets. The Gaussian, mean curvatures and the location of umbilic points on the conflict surface are determined here. Initial results on the Darbouxian type of umbilic points on conflict surfaces are also established. The results are expressed in terms of the principal...
We study deformations of hypersurfaces with one-dimensional singular loci by two different methods. The first method is by using the Le numbers of a hypersurfaces singularity — this falls under the general heading of a “polar” method. The second method is by studying the number of certain special types of singularities which occur in generic deformations of the original hypersurface. We compare and contrast these two methods, and provide a large number of examples.
It is known that a closed polygon P is a critical point of the oriented area function if and only if P is a cyclic polygon, that is, P can be inscribed in a circle. Moreover, there is a short formula for the Morse index. Going further in this direction, we extend these results to the case of open polygonal chains, or robot arms. We introduce the notion of the oriented area for an open polygonal chain, prove that critical points are exactly the cyclic configurations with antipodal endpoints and derive...
The Voronoi diagram of n distinct generating points divides the plane into cells, each of which consists of points most close to one particular generator. After introducing 'limit Voronoi diagrams' by analyzing diagrams of moving and coinciding points, we define compactifications of the configuration space of n distinct, labeled points. On elements of these compactifications we define Voronoi diagrams.
Page 1