Medial Axis and Singularities

This paper is devoted to the study of the medial axes of sets definable in polynomially bounded o-minimal structures, i.e. the sets of points with more than one closest point with respect to the Euclidean distance. Our point of view is that of singularity theory. While trying to make the paper self-contained, we gather here also a large bunch of basic results. Our main interest, however, goes to the characterization of those singular points of a definable, closed set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X\subset {\mathbb {R}}^n$$\end{document}X⊂Rn, which are reached by the medial axis.

The main motivation for this paper, apart from the fact that medial axes are of utmost importance in pattern recognition and robotics, were the results of [1] and [9]. Despite the fact that the subject of medial axes, central sets, skeletons, cut loci (all these notions denote more or less the same concept and are often incorrectly interchanged) has been extensively studied, astonishingly few results concern the relations to singularities. Our purpose is to study the medial axis on the grounds of singularity theory. The bibliography we present is certainly far from being exhaustive.

Preliminaries
Throughout this paper, definable means definable in some polynomially bounded ominimal structure expanding the field of reals R (for a concise presentation of tame geometry see, e.g. [5]; for simplicity, one can always think about semi-algebraic sets, see also [6]). On the other hand, when we speak of subanalytic sets (see [7] or [8]), then we should keep in mind that they do not form an o-minimal structure unless we control them at infinity (or near the boundary). This does not play any role in the local case, but from the global point of view, the difference is important (see [7] and [9]).
In this section, we present several facts that are of some use. Actually, most of them hold in general, as can be seen from the proofs. The same is true for the results presented in Sect. 2. When the definability is needed, we shall state it clearly.
The main objects we are interested in are the following. Consider a nonempty, closed set X R n and write d(x) := d(x, X ) = inf {||x − y|| : y ∈ X } for the Euclidean distance; it is a globally 1-Lipschitz function. We define the set of closest points to x ∈ R n or supporting set of x as m(x) := {y ∈ X | ||x − y|| = d(x, X )} which is a compact, nonempty subset of X intersected with the sphere S(x, d(x, X )). We denote by B(x, r ) the open Euclidean ball centred at x and with radius r > 0 and so S(x, r ) = ∂B(x, r ). For r = d(x, X ), we call the sphere or ball supporting. Note that X cannot enter a supporting ball.
Recall also that any point x ∈ B(a, r ) where a ∈ X has its distance d(x, X ) realized in B(a, 2r ). As already proved, e.g. in [9], m(x) is a definable multifunction 1 -if X is definable.
We write [x, y] for the segment joining x to y and [x, y) := [x, y] \ {y}, whenever x = y.
We shall denote by C a (X ) the Peano tangent cone of X at a ∈ X , i.e.
Of course, both sets are definable/subanalytic in the definable or subanalytic case and we have the inequalities dim C a (X ) ≤ dim a X and dim N a (X ) ≥ n − dim a X . We shall be using also some continuity properties, especially of the multifunction m(x). We briefly recall after [12] the Kuratowski upper and lower limits of a multifunction F : R n → P(R m ) at a point x 0 : • y ∈ lim inf x→x 0 F(x) iff for any sequence x ν → x 0 , x ν = x 0 , one can find a sequence F(x ν ) y ν → y; • y ∈ lim sup x→x 0 F(x) iff there are sequences x ν → x 0 , x ν = x 0 , and F(x ν ) y ν → y.
We take here into account only points from the domain of F, i.e. the set of points x for which F(x) = ∅ (and x 0 is an accumulation point of this domain). Of course, the upper limit contains the lower one, and both are closed sets that do not alter if we replace the values of F by their closures. For details in respect of the definable case, see [6]. In particular, By the Curve Selection Lemma, in the definable case, we can replace the upper limit by the limit itself (see e.g. [12]).

Medial Axis, Normal Sets and Central Set
We may see X as the boundary of the open set = R n \ X and thus d(x, X ) is the distance to ∂ . This is the usual setting for the notions of medial axis and central set used introduced hereafter.
Definition 2. 1 The medial axis of is the set of points admitting more than one closest point to the boundary: By the strict convexity of the norm, M X is nowheredense; besides, it is definable in the definable setting and subanalytic for a subanalytic set X (see, e.g. [9]).
There are two more useful sets as far as the realization of the distance is concerned. Namely, the normal set N (a) = x ∈ R n | a ∈ m(x) = x ∈ R n | ||x − a|| = d(x, X ) , a ∈ X and the univalued normal set N (a) = x ∈ R n | m(x) = {a} , a ∈ X.
Below we gather some basic and known properties of N (a) and N (a):

Proposition 2.2 In the introduced setting,
(1) a ∈ N (a) ⊂ N (a); (2) N (a) is closed, convex and definable (respectively, subanalytic), actually X a → N (a) is a definable (resp. subanalytic) multifunction, when X is definable (resp. subanalytic); (3) N (a) ⊂ N a (X ) + a; (4) x ∈ N (a) ⇒ [a, x] ⊂ N (a) and x ∈ N (a) \ {a} ⇒ [a, x) ⊂ N (a); (5) For any non-isolated a ∈ X, lim sup X b→a N (b) ⊂ N (a); (6) N (a) is convex and definable/subanalytic (as a set and as a multifunction of a ∈ X ) when X is definable/subanalytic; Proof (1) is obvious, (2) is discussed in [15] and [9]. In order to prove that N (a) is definable or subanalytic as a multifunction, it suffices to observe that its graph coincides with the graph m of m(x) itself 2 , up to a permutation of coordinates. Next, (3) is to be found in [9], (4) follows from the strict convexity of the norm, and (5) for N (a) is proved in [9]. To prove (6), we observe that for x ∈ [x 1 , x 2 ], where x 1 , x 2 ∈ N (a), and we have the inclusion and B(x j , ||x j − a||) ∩ X = {a}. It remains to prove the definability/subanalycity, when X is definable/subanalytic. Observe that where cc(m(x)) denotes the family of connected components of the set m(x). Both functions x → dim( m ) x and x → #cc(( m ) x ) 3 in the description are definable/subanalytic (for the second one see [6], the set m is v-relatively compact) and the assertion follows. Example 2. 4 It is obvious that a ∈ int X implies #N (a) = 1. We do not have necessarily the converse implication: Consider X = {y ≤ |x| 3/2 }. Then M X = {0} × (0, +∞) (see, e.g. Lemma 3.17) and N ((0, 0)) = {(0, 0)}.

Remark 2.5
As is easily seen from the example of y = |x| as X and a = (0, 0) in (5) from Proposition 2.2, we usually do not have an equality.
Property (5) does not hold for N (a). First of all, the upper limit is always a closed set, while N (a) need not be so, as we have just seen. But apart from that, we cannot hope even for an inclusion lim sup X a ν →a N (a ν ) ⊂ N (a) as can be seen by taking

Theorem 2.7 There is
Proof If x ∈ M X we take any a ∈ m(x) and clearly x ∈ N (a) \ N (a). On the other hand, if x ∈ N (a) \ N (a), then a ∈ m(x) is not the only point in m(a), whence x ∈ M X . In the second equality, the set on the left-hand side clearly contains the set on the right-hand side. If x ∈ N (a) \ N (a), then m(x) does not reduce to a singleton, and hence x / ∈ N (b) for any b ∈ X . The last equality follows from the obvious observation that there is a∈X N (a) = R n .

Proposition 2.9
In the definable case, the set X : Proof Ad(1): Remark that X is the image of the difference of definable graphs N \ N ⊂ X × R n by the projection onto X . Ad (2): This is obvious.

Remark 2.10
Note that X need not be dense in X if only M X = ∅. Indeed, take Another notion closely related to the medial axis is the central set.

Definition 2.11
We call B(x, r ) ⊂ a maximal ball for , if The set of the centres of maximal balls for is called the central set. We denote it by C X .
There are two natural characterizations of the medial axis and the central set that sometimes prove rather useful: Moreover, in both cases ∃ can be replaced by ∀.
Proof The first equivalence is a reformulation of Theorem 2.7 together with the remark following it, as a ∈ m(x) means exactly x ∈ N (a). The second one requires a short discussion. Note On the other hand, if (R + (x − a) + a) ∩ N (a) = [a, x], then for any ball B(x, ||x − a||) ⊂ B(y, r ) ⊂ R n \ X we necessarily have a ∈ ∂B(y, r ) together with r = ||y −a|| and so y ∈ (R + (x − a) + a) ∩ N (a). This implies y = x and so x ∈ C X .
One last notion, closely related to the previous ones is that of the conflict set of a given finite family of nonempty sets (cf. [1]): Definition 2.14 If X 1 , . . . , X k ⊂ R n are closed, pairwise distinct, nonempty sets, where k ≥ 2, and (x) := min k i=1 d(x, X i ), then the set of equidistant points is called the conflict set of X 1 , . . . , X k .

Remark 2.15
Usually, the sets X i in the definition of the conflict set are assumed to be pairwise disjoint. Thanks to this assumption the dimension of the conflict set does not exceed n − 1 (cf. [1]). Otherwise, we lose some control: consider, e.g. X 1 , X 2 as the half-lines y = x, x ≥ 0 and y = −x, x ≤ 0, respectively. Then Conf(X 1 , X 2 ) is the union of the half-line x = 0, y ≥ 0 together with the oblique quadrant y ≤ −|x|. Naturally, the definition makes sense also in any metric space. In particular, if all the sets X i are contained in E ⊂ R n , we can compute the relative conflict set Conf E (X 1 , . . . , X k ) with respect to a given metric in E (we shall need this later for a sphere with its geodesic metric, cf. Theorem 3.26).

Some Remarks on the Multifunction m(x)
We recall the following notion from [12]. Let F : R m → P(R n ) be a multifunction. For a ∈ domF, we consider Finally, we may consider a point pre-image defined for a point y ∈ F(a) as the section We are particularly interested in the multifunctions m : R n x → m(x) ⊂ X, N : X a → N (a) ⊂ R n and also N . As already noted, m and N share the same graph up to a permutation of the coordinates.
We readily observe that for a ∈ X , Moreover, for a ∈ R n , Recall that for a multifunction F as above and G : Let us compose m with N in two ways. First for (x, z) ∈ R n × R n (x, z) ∈ N •m ⇔ ∃y ∈ X : y ∈ m(x) and z ∈ N (y) ⇔ ∃y ∈ X : y ∈ m(x) and y ∈ m(z) In particular, if we denote : By the results of [12] Section 6, we have a Łojasiewicz-type inequalities in the definable setting: Proposition 2. 16 Let F denote either the closed multifunction N (x), x ∈ X, or the compact one m(x), x ∈ R n . Then for any point x 0 in the domain of F, there are constants C, > 0 such that in a neighbourhood of x 0 , where dist H K denotes the Hausdorff-Kuratowski distance 4 , and F • (F(x 0 )) stands for any of the pre-images introduced above. In particular, The result follows directly from [12] Corollary 6.4. To prove the particular cases, we use the computations made above for the strong pre-image of N of x 0 ∈ X (this gives (1)), the strong pre-image of m of x 0 ∈ X and the fact that N (x 0 ) = N (x 0 ) (this gives (2) and (3)); the weak pre-image of m gives (4); (5) follows from m * (m(x 0 )) ⊂ M X when x 0 ∈ M X . Now, we can add a property of m(x) that is useful in this context (no definability is needed). Proof If y = lim y ν for some y ν ∈ m(x ν ) where D x ν → x 0 , then ||y ν − x ν || = d(x ν , X ) and so passing to the limit yields y ∈ m(x 0 ).
As for the converse inclusion, by [12], we have nothing to prove, if m(x 0 ) reduces to a point. Now, if y ∈ m(x 0 ), we can assume that [x 0 , y] \ {x 0 } is nonempty. Take neighbourhoods U y and V x 0 . Then ∅ = V ∩ [x 0 , y] \ {x 0 } ⊂ N (y) (cf. Proposition 2.2 (4)). Hence, arbitrarily near x 0 , we can find points x with m(x) = {y}. But D is dense, so arbitrarily near x there are points x ∈ D and as #m(x) = 1, again by [12] we have the continuity of m at x. Thus, there is a point x ∈ D ∩ V for which m(x ) ∩ U = ∅. We have shown that lim sup D x→x 0 m(x) = m(x 0 ).

Remark 2.18
Note that along M X we usually only have an inclusion (see [9]): Another useful fact is the following observation that holds in general.

Proposition 2.19
Let U ⊂ R n be open and nonempty. Assume that there is a continuous selection μ : U → X for m(x), i.e. for any x ∈ U , μ(x) ∈ m(x). Then μ = m| U , i.e. m(x) is univalent on U .
Proof Obviously, by the preceding Proposition, μ coincides with m on U \ M X . Suppose that there is a point x ∈ U ∩ M X . Then by Theorem 2.7, x ∈ N (a) \ N (a) for some a ∈ X . From the definition of the normal set, it follows that x ∈ N (b) for some b ∈ X \ {a}. Then when we approach x along the two distinct segments [a, x] and [b, x], we get two different limits for μ, contrary to the continuity.

On the Distance Function and the Medial Axis
As already observed in [17] (without a proof), the set M X is related in a most natural way (based on the results of [4]) to the singularities (non-differentiability points) of the function δ(x) := d(x, X ) 2 . Namely, we give a simple proof of the Theorem 2.23 below. Before we do it, we recall that for any locally Lipschitz function f : U → R with U ⊂ R n open, the Rademacher Theorem asserts that the set D f of differentiability points is dense in U . Hence, we can define the Clarke subdifferential ∂ f (x) at any point x ∈ U as the convex hull cvx∇ f (x) of the set ∇ f (x) of all the possible limits of the gradients ∇ f (x ν ) for sequences D f x ν → x. It is easy to see that ∂ f (x) is a compact set, and by [4], it reduces to a point y iff x ∈ D f and ∇ f | D f is continuous at y (then ∂ f (x) = {y}). Of course, to compute ∂ f (x), we may restrict ourselves to any dense subset of D f (see [4]). Some discussion of x → ∂ f (x) as a multifunction is presented in [12]. For the moment, we do not need any definability assumptions.
Actually, we will need a slightly altered version of this lemma: is well-defined and continuous in U . Moreover, d(x + tv(x)) = ||x − m(x)|| + t for x ∈ U and small t < 0 (then x + tv(x) ∈ U ). Therefore, for any x ∈ D d ∩ U , while the left-hand side is smaller than ||∇d(x)|| by the Cauchy-Schwarz inequality.
Observe that d(x) being 1-Lipschitz we have ||∇d(x)|| ≤ 1 at any differentiability point x ∈ D d 5 , so ||∇d(x)|| = 1. Note also that u, w = ||u|| · ||w|| cos (u, w) and so in view of the fact that we get ∇d(x), v(x) = ||∇d(x)|| = 1, we conclude that ∇d(x) = λv(x) for some λ > 0 6 . Again ||v(x)|| = 1 implies λ = 1 and we are done. By the continuity of v(x), the formula holds in the whole of U (the only possible value for the subdifferential ∂d(x) at x ∈ U is v(x) and ∇d(x) varies continuously on D d ∩ U due to the continuity of v(x)). Clarke's results ([4, Proposition 1.13]) give the assertion.
Of course, the function δ(x) = d(x) 2 is a locally Lipschitz function. This function encodes information about the singularities of X , see [15]. Moreover, we can compute ∇δ(x) also for points x ∈ X , getting zero. This leads to: Proof The set of differentiability points D δ contains the analogous set D d of d. By the previous Lemma, for any x / ∈ M X ∪ X , we can compute On the other hand, for any point The last part of the Lemma follows from [4] together with Proposition 2.17.
Part of the following theorem appeared as Proposition 2.2 in [17] without a proof. In order to make our paper self-contained, we give a direct proof-independent of [4] Theorem 2.1 evoked in [17]-of a slightly extended version of this result 7 .
(2) The following conditions are equivalent: Proof Clearly, in order to get the equivalence (a)⇔(b), we need only to show the formula for ∂δ (x). If x / ∈ M X , then the last Lemma gives ∇δ(x) = 2(x − m(x)). Moreover, we know that D = R n \ M X is dense in R n . Clearly, a sequence {∇δ(x ν )} for {x ν } ⊂ D converging to some x 0 , has a limit if and only {m(x ν )} has a limit. Therefore, Proposition 2.17 ends the proof of (1).

Remark 2.24
At x ∈ D d ⊂ D δ , we have ∇δ(x) = 2d(x)∇d(x), and from (3), we see that the discontinuity points of ∇d must belong to ∂ X . To be more precise, ∂int X ⊂ ∂ X are certainly discontinuity points of ∇d since we can reach them both from the interior of X (where the gradient vanishes) and from R n \ X (where the gradient has norm 1). On the other hand, isolated points of X do not belong to D d .
Note that on D δ = R n \ M X the multifunction m(x) is univalued and we have the obvious relation δ(x) = ||x − m(x)|| 2 . However, m need not be differentiable there as we can easily see by taking X = {x y = 0, x, y ≥ 0} ⊂ R 2 and the point Finally, remark that whenever m(x) is univalued, we have the formula which apart from X can be rewritten also as In particular, we conclude that basic differential properties of m are related to the Hessian of δ.
The relation between the medial axis and the central set is known (see [13] and the citation in [3]) and given in the following theorem which we prove in a different way than it is done in [13]. All the same, our proof is most probably a standard one.

Theorem 2.25
For a closed, nonempty set X R n , consists of more than one point, and the boundary of any ball B(x, d(x, X )) ⊂ B(y, r ) ⊂ R n \ X has to be tangent to S(x, d(x, X )) at any point of m(x). Hence For the second inclusion, we have more to do. Consider the open set U : Fix a ∈ U and observe that for any x ∈ (m(a), a] ⊂ U we have ∇d(x) = ∇d(a). Let us parametrize the segment by arc-length, i.e.
We obtain In other words, x(t) is the solution of the equation x = ∇d(x) (in U ) with initial condition x(d(a)) = a. The right-hand side is continuous, whence the Cauchy-Peano Theorem guarantees that x(t) can be extended as γ (t) to some interval (0, d(a) + ε). Put γ (0) = m(a) extending γ continuously to [0, d(a) + ε).
Since ||∇d(x)|| = 1, this extended integral curve γ (t) is automatically parametrized by arc-length and so has length d(a) + ε. If we prove that due to the definition of the set U where γ lives) and so a / ∈ C X 8 . Actually, ( ) follows from an easy computation: The discussion above shows that C X ⊂ M X ∪ X . However, by definition, C X ∩ X = ∅ and so we are done.

Remark 2.26
The inclusions may be strict: for the first one consider X = {y = x 2 } in R 2 (then the focal point (0, 1/2) ∈ C X \ M X ), for the second one see [3] Example 2.2.
These inclusions, although simple, prove often useful, for example:

Theorem 2.27 Let ⊂ R n be open and such that it does not contain a half-space
Then r ≥ 1 is finite since does not contain a half-space. We will show that x r ∈ M X . Note that we necessarily have r = d(x r , X ).
Suppose that x r / ∈ M X . Then, since C X ⊂ M X , we would find a ball B(z, ρ) ⊂ containing B(x r , r ). But as y ∈ B(x r , r ) ⊂ B(z, ρ), we must have y ∈ ∂B(z, ρ). But this implies that z = x t for some t > r which contradicts the definition of r . 8 Indeed, the point a ε := γ (d(a) + ε) lies in U , hence its distance to X is realized in precisely one point. But when we know that d(a ε ) = d(a) + ε so that γ is the segment [m(a), a ε ], we see that on the sphere S(a ε , d(a ε )) we already have the point m(a), so there must be a ε ∈ N (m(a)). In particular, B(a, d(a)) B(a ε , d(a ε )), whence a / ∈ C X . 9 By half-space we mean a set of the form

Remark 2.28
Taking the closure in the proof is necessary as we can see from the example X = {v = u 2 } with y = (0, 0); we obtain r = 1/2 and x r = (0, 1/2) ∈ M X \ M X .

Reaching of Singularities of Hypersurfaces
Let us fix some more notation: for k ∈ N ∪ {∞, ω} we put and Sng k X := X \ Reg k X . In the analytic case, i.e. for k = ω, we omit the index.
Of course, even a plane analytic curve can have almost any type of singularity in the sense that 0 ∈ SngX if and only if either has a cusp at zero, or there is an integer k ≥ 1 such that 0 ∈ Reg k X ∩ Sng k+1 X and all the possibilities can occur: Example 3.1 Take two relatively prime integers p > q such that for a given k we have k < p/q < k + 1 and consider the curve X defined by y q = x p . Then 0 ∈ Reg k X ∩ Sng k+1 X . For instance the function y = x 5/3 has analytic graph and is C 1 but not C 2 smooth at the origin.
The starting point of our considerations is the observation made in [9] that there are natural instances when M X reaches the singularities of X . However, this does not happen always.
It is worth to note at this point that for a given a ∈ X , we have We will need the following result completing a Lemma of Yomdin (Part 3, Lemma 1 in [17]): Lemma 3.4 Let X ⊂ R n be a closed, nonempty set, x 0 ∈ R n \ X a point and B = B(x 0 , r ) a ball such that B ∩ X = k j=1 X j where the sets X j are nonempty and pairwise disjoint, and for at least one i, X i ∩ B = ∅. Then there exists a neighbourhood U of x 0 such that By passing to a subsequence, we may assume that min k j=1 d j (x ν ) = d 1 (x ν ) for all ν. We can find points y ν ∈ X \ B and z ν ∈ X 1 such that ||x ν − y ν || = d(x ν ) and ||x ν −z ν || = d 1 (x ν ). Since X 1 is compact, by extracting a subsequence, we may assume that z ν → z 0 ∈ X 1 . Similarly, in view of the inequality ||y ν || ≤ ||y ν − x ν || + ||x ν ||, we see that the sequence {y ν } is bounded and again we may assume that y ν → y 0 .
But this means that for any j, X j ⊂ ∂ B contrary to the assumptions.

Remark 3.5
In the situation of the Lemma above, we have in particular that M X ∩U = Conf(X 1 , . . . , X k ) ∩ U .

General Remarks on Hypersurface Singularities
We suppose that X is locally homeomorphic to R n−1 .

Lemma 3.6
Assume that x 1 , x 2 ∈ R n \ M X are different but m(x 1 ) = m(x 2 ) = a. If, moreover, the vectors x 1 − a and x 2 − a are linearly independent, then a ∈ Sng 1 X.
Proof The two hyperplanes H i defined by the vectors x i − a are different. If we had a ∈ Reg 1 X , then by the choice of a, we would have (x i − a)⊥T a X for i = 1, 2, whence T a X = H 1 = H 2 which is a contradiction. Proposition 3.7 Assume that in a neighbourhood U of x 0 ∈ R n we have m ≡ a ∈ X. Then a ∈ Sng 1 X.
Proof We know that M X is nowheredense, hence U \ M X = ∅. Thus, we can apply the preceding Lemma to some points x 1 , x 2 . Proof By assumption, m is univalued in a neighbourhood U of x 0 and so also continuous. Thus, if we fix a neighbourhood V m(x 0 ) such that V ∩ X is C 1 -smooth, we can find a ball B ⊂ U centred at x 0 such that m(B) ⊂ V . By Proposition 3.7, for Recall that in case X = Reg 2 X , for any point a ∈ X and x 0 belonging to the normal line (T a X ) ⊥ + a to X at a, the function φ(y) = ||x 0 − y|| 2 , y ∈ X , has a local minimum at y = a if and only if there is no focal point on [a, x 0 ] \ {x 0 } (see [16] 11 ).
Observe that having a local minimum at a does not necessarily mean that a realizes the distance of x 0 to X . However, if a is a local minimum in B(a, r ) ∩ X and r satisfies

Superquadratic Functions
Motivated by the examples considered so far, we introduce the notion of superquadraticity.
Let X be the graph of a non-negative continuous function germ f :

Definition 3.9
In this situation, we call X superquadratic at the origin, if the function There are two other closely related definitions: Definition 3. 10 We define the order at zero of a continuous definable function germ f : (R n , 0) → (R, 0) as if f ≡ 0, and ord 0 f := +∞ otherwise.

Remark 3.11
Clearly, the definition is well-posed since we are in a polynomially bounded o-minimal structure, by the Łojasiewicz inequality. It is a mere exercise to prove that in one variable g(t) = at α + o(t α ) is written precisely with α = ord 0 g and |g(t)| ≤ const.|t| α . By the methods used by Bochnak and Risler in [2] Theorem 1, it is easy to show that the least upper bound in the definition is in fact attained.
Note also that the inequality defining the order is satisfied with any exponent α ≤ ord 0 f and that it makes sense also for a vector-valued f ; then it is written as || f (x)|| ≤ const.||x|| η . In the latter case, ord 0 f coincides with the minimal order of the components Definition 3. 12 We call sectional order at zero for a definable function f : 0). Then for the following three conditions: Then 0 is an accumulation point of A and so there is a continuous definable selection r → (r, γ (r )) ∈ A.
Then g | f | (r ) = | f (γ (r ))| and it follows from the definition of the order of vanishing (note that for small r , the values γ (r ) are near zero) that ord 0 g | f | ≥ ord 0 f and so ord 0 g | f | ≥ 2 as required 13 .
Remark 3.14 The equivalence (2) ⇔ (3) allows us to extend the Definition 3.9 to any set being the graph of a definable function.
Example 3. 15 The implication (2) ⇒ (1) does not hold in general. To verify this, consider the semi-algebraic function 12 Also in this case the upper bound is attained. 13 We even have ord 0 But if there were ord 0 f ≥ 2, then we would have in a neighbourhood of zero, f (x, y) ≤ C||(x, y)|| 2 for some constant C > 0. In particular, this would hold for (x, y) = tv for any v ∈ S and all t ∈ (0, ε) with an appropriate ε > 0. However, this would lead to v 1 /v 2 ≤ C which yields a contradiction when we make In the next subsection, we will give yet one more characterization of superquadraticity (Proposition 3.18). The example of f (x) = |x| 3/2 shows that there may be f (0) = 0 and ord 0 f ∈ (1, 2). Note also that without the assumption of definability, the differentiability of f at zero together with ∇ f (0) = 0 need not imply ord 0 f > 1. We define f as follows: consider the sequence x ν := 1/ν ν 2 and put f (x ν ) = 1/ν ν 2 +ν−1 ; then we join the obtained consecutive points by segments in order to obtain a piecewise linear curve defined on If there were constants r, C, ε > 0 such that f (x) ≤ C|x| 1+ε for |x| < r , then for all ν sufficiently large we have x ν < r and 1/ν < ε so that C x 1+ε ν < νx 1+1/ν ν which gives a contradiction. Therefore, ord 0 f = 1.  − r v, r ) ∪ B(a + r v, r ) where r > 0.

Plane Case
In this section, we consider a pure one-dimensional closed definable set X ⊂ R 2 with 0 ∈ X . In particular, in a neighbourhood of zero, X consists of finitely many branches ending at zero. Each branch can be realized as the graph of a definable function f : [0, ε) → R with f (0) = 0 (in properly chosen coordinates in R 2 ).
Observe that the curve f (t) = at α + o(t α ) (with a = 0, α > 0) for 0 < t 1 is C 1 at zero iff α ≥ 1. By analogy to the Definition 3.9, we say that this curve is superquadratic at zero iff α < 2. In particular, if X is a graph, it is superquadratic iff one of the two branches is superquadratic. Let us note the following easy lemma. This Lemma is an observation that leads to yet another characterization of superquadraticity for any hypersurface X ⊂ R n : Proposition 3.18 Let X ⊂ R n be a closed definable set such that the tangent cone C 0 (X ) is a linear hyperplane and X ∩ U is a graph over it, for some neighbourhood U of 0 ∈ X . Then the following assertions are equivalent: (1) X is superquadratic at the origin.
We go back to the plane case. First, we recall that for a C 2 smooth curve y = f (x) its curvature radius at (x, f (x)) is given by Moreover, it is known that the point (x, f (x)) realizes the distance d ((a, b) is orthogonal to f at (x, f (x)) and ||v|| < r (x).

Theorem 3.19
Assume that 0 ∈ Reg 1 X ∩ Sng 2 X . Then 0 ∈ M X iff X is superquadratic at the origin.
Proof The problem is local and so we may assume that X \ {0} is C 2 -smooth. Furthermore, the tangent cone C 0 (X ) being a line we may write X as the graph of a C 1 definable function f : We start with proving the 'if' part. Let be the branch of f for t ≥ 0 and suppose that it is superquadratic. We may also assume that f is convex on [0, 1).
Denote by a ε (t) = (t, f (t)) + εν(t) the centres of the discs for t ∈ (−1, 0]. If we start sufficiently far from zero, i.e. for some t ε near −1, and with a sufficiently small ε, we will have B(a ε (t ε ), ε) ⊂ {(x, y) | x < 0}. In particular, Observe that taking a smaller ε allows us to choose t ε nearer to zero.
Consider the continuous function We have φ ε (t ε ) < 0. On the other hand, since B(a ε (0), ε) ∩ = ∅, it is clear that the distance of a ε (0) to is smaller than the radius of the disc. Hence, φ ε (0) > 0. Now the Darboux property implies that for some t ε ∈ (t ε , 0) we have φ ε (t ε ) = 0 which means precisely that is tangent to the disc B(a ε (t ε ), ε). So a ε (t ε ) belongs to the medial axis M X of the graph of f and as t ε → 0 when ε → 0, we conclude that (0, 0) ∈ M X . Of course, in order to roll the disc properly we need an extra assumption. Namely, either the branch of f for t < 0 is concave, or it is non-superquadratic at the origin. Indeed, if it is concave, then due to our choices, the disc rolls on the concave side. If, however, it is convex but non-superquadratic at the origin, then: • firstly, the definability assures us that f | (−1,0) has a C 2 extension through zero, and so we can compute its curvature at any point; • secondly, it follows from the standard formula for the curvature that the curvature radius in this case stays away from zero.
Summing up, we conclude that for all ε small enough, the discs of radius ε are tangent to at any point.
We are left now only with the case when is convex and superquadratic at zero just as . We proceed as follows.
Any disc B((0, ε), ε) has points of and inside. Fix ε and keeping the centre at (0, ε), decrease the radius to ε so that 0 / ∈ B((0, ε), ε ) =: B(ε ). Then the intersection of B(ε ) with the graph of f consists of two connected components C 1 , C 2 the conflict set of which contains a part of M X . Indeed, this is a consequence of Lemma 3.4 and the remark following it. This ends the proof, since we may repeat the argument starting from a smaller ε.
To prove the 'only if' part, suppose that X is not superquadratic at zero. The function f has two branches f + (t) = a + t α + +o(t α + ) for t ∈ [0, ε) and f − (t) = a − t α − +o(t α − ) for t ∈ (−ε, 0]. Since X is not superquadratic, we have α + , α − ≥ 2. In this case, both branches have C 2 extensions through zero which means that we are able to roll a ball of a fixed radius on both sides of X . This ends the proof. Example 3.20 In more variables, the situation is not that clear. Consider X to be the graph of f (x, y) = |x y|. It is easy to see that ord 0 f ≥ 2, i.e. f is not superquadratic at zero, but it is differentiable at this point with ∇ f (0, 0) = 0. However, M X reaches the origin. Of course, 0 / ∈ Reg 1 X .
Consider two half-lines i = R + v i starting at zero, where v i ∈ S 1 . We call bisector of the angle formed by 1 For a curve (one-dimensional set) X ⊂ R 2 , the tangent cone at any of its points consists of finitely many half-lines. This tangent cone is linear if and only if there are only two half-lines 1 , 2 such that ( 1 , 2 ) = π . Theorem 3.21 Let X ⊂ R 2 be a definable curve with 0 ∈ Sng 1 X . Then 0 ∈ M X , provided the germ (X \ {0}, 0) has at least two connected components. Remark 3.22 By the Nash Lemma (see, e.g. [9, Lemma 1.1]), if 0 ∈ Reg 2 X , then M X stays away from X in a neighbourhood of the origin. Hence, both Theorems above together with Proposition 3.24 below completely describe the reaching of the singularities in the plane case.
Proof If we restrict to a neighbourhood of zero, then we may assume that X \ {0} is of class C 2 and has a finite number, say k, of branches i . We know that k ≥ 2.
First suppose that k = 2. Then, having a singularity means in this case that C 0 (X ) is not linear, i.e. it consists of two lines forming an angle different from π (but it could be zero). We are working in a ball B centred at zero, divided by X into two domains D 1 , D 2 15 . Since N (0) ⊂ N 0 (X ), we conclude that on one side of 0 in B, say in D 1 , there are no points whose distance to X is realized in zero 16 . Of course, this does not depend on the radius of B (provided it is sufficiently small).
Consider now any small ball B ε B centred at zero. From the assumptions made so far, we infer that C ε := D 1 ∩ ∂ B ε is an arc of the circle ∂ B ε going from 1 to 2 17 . If we restrict to it the function x → d(x, 1 ) − d(x, 2 ), then we see that it changes sign, whence C ε ∩ Conf( 1 , 2 ) = ∅. 15 Note the definability implies that the two branches i can be seen as graphs with constant convexity. 16 Indeed, in a possibly smaller B, the two branches lie entirely outside N 0 (X ) \ {0} and so does the region D 1 between them. 17 i.e. C ε ∩ X consists of two distinct points, one on 1 , the other on 2 .
If we pick a point a ∈ C ε ∩ Conf( 1 , 2 ), then from the definition of the conflict set, it follows that here are two points b i ∈ i such that ||a − b 1 || = d(a, 1 ) = d(a, 2 ) = ||a − b 2 ||. But X = 1 ∪ 2 and 0 / ∈ m(a), whence b 1 , b 2 ∈ m(a) and so a ∈ M X (see also Remark 3.23 hereafter). Since ε is arbitrarily small, the proof is accomplished. Now, assume that k ≥ 3. Actually, the argument is quite the same, the only difference being that the linearity or nonlinearity of the tangent cone changes the start-point. Indeed, if C 0 (X ) is nonlinear, then we can extract, so to say, two different branches i , j such that • their tangent half-lines at zero form an angle different from π ; • in one of the two regions they divide B in, call it D, there are no other branches of X .
Then we can repeat the same argument showing that part of the conflict set Conf( i , j ) in D is contained in M X and so it approaches zero.
Otherwise, if C 0 (X ) is linear, then, again, among the k ≥ 3 branches of X \{0} there must be two branches that satisfy the two requirements above. The only difference is that now we know that the angle between the tangent half-lines is 0, which does not affect the argument.
This ends the proof. If the intersection X ∩ Y has more than one point, there is no such a simple relation between the medial axis and the conflict set as we can see, for instance, from the example of X being the unit circle in R 2 together with the point (2, 0) and Y just the unit circle.

Proposition 3.24
Assume that X ⊂ R 2 is a definable curve such that 0 ∈ X and the germ (X \ {0}, 0) is connected. Then 0 / ∈ M X .
Proof The tangent cone C 0 (X ) is a half-line that we can assume to be the x-axis for x ≥ 0. Moreover, we can assume that X near zero is a graph of a definable, convex function f : [0, ε) → R, f (0) = 0 that is C 2 on (0, ε) and has a C 1 extension through zero with f (0) = 0. If the extension can be made of class C 2 , then by the Nash Lemma we conclude that 0 / ∈ M X . Suppose thus that there is only a C 1 extension. This means that when we write f (t) = ct α + o(t α ) with c, α > 0, there must be α ∈ (1, 2), i.e. f is superquadratic.
Observe that N 0 (X ) = {(x, y) | x ≤ 0}. By the superquadraticity and the convexity of f , we conclude that no point (0, y) with y > 0 has its distance to X realized at zero. On the other hand, it is obvious that for all other points from N 0 (X ) sufficiently near zero, the origin is the unique closest point in X .
Take a point a(y) = (0, y) with a small y > 0 and consider the supporting sphere S (a(y), d(a(y), X )). This circle touches X in a finite number of points none of which is the origin, by superquadraticity. But the function y → #m(a(y)) is definable (cf. [6]) which implies that for all y > 0 near zero it must be constant, equal to 1 (cf. the points in m(a(y)) tend to zero when y → 0 + and X is a graph near zero). This ends the proof.
We end this section by describing the tangent cone of M X when this set reaches X . Note that as X \ {0} consists of finitely many branches ending at zero, the tangent cone C 0 (X ) is the union of finitely many half-lines being the tangents of these branches. As can be expected, it turns out that the tangent cone of the medial axis consists of all the bisectors of the half-lines forming up C 0 (X ). However, as the next example shows, not all the pairs of half-lines are to be taken into account.
Example 3.25 Let X ⊂ R 2 be the graph of y = x 2 together with the curve y = −x 2 for x ≥ 0. Therefore, X has three branches ending at the origin and C 0 (X ) is the xaxis. Clearly, 0 ∈ M X (as M X = (0, +∞) × {0}), but only the two branches y = ±x 2 contribute to this. Both have [0, +∞) × {0} as the tangent cone at zero and so the bisector coincides with this half-line. Of course, it is C 0 (M X ).
A similar situation occurs for a λ-shaped curve.
Before we state and prove the theorem on the tangent cone, let us introduce some notions that will help to state the result.
For a plane definable germ (X, 0), we say that two branches 1 , 2 at zero are consecutive, if they bound a region near zero which does not contain any other branch of X 18 . There is only one such region, if X has more than two branches. In this case, we denote it by D( 1 , 2 ).
Assume that 0 ∈ M X . Of course, M X is the union of all the medial axes M 1 ∪ 2 ∩ D( 1 , 2 ) for all pairs of consecutive branches 1 , 2 (assuming that X has more than two branches). We say that a region delimited by a pair of consecutive branches contributes to M X at zero, if the origin belongs to the closure of the corresponding medial axis 19 .
If X has only two branches at zero, then there are two regions delimited by them, which we denote D ± . It may happen that M X appears in only one of these regions (as for X : y 2 = x 3 ), or in both of them (as for X : y = sgnx|x| 3/2 ). In this case it is natural to consider the two branches as two different pairs of consecutive branches, distinguished by their ordering.
Finally, let us recall one theorem from [1] that we shall use in the proof.
Theorem 3.26 (Birbrair-Siersma) Let X 1 , . . . , X k ⊂ R n be closed, definable, pairwise disjoint, nonempty sets such that 0 belongs to K := Conf(X 1 , . . . , X k ) and let S := S(0, d(0, X 1 )) be the supporting sphere at 0. Then C 0 (K ) is the cone spanned over the conflict set Conf S (X 1 , . . . ,X k ) in the sphere, whereX i : Here, what we mean by a cone spanned over a subset E of the sphere S centred at zero is the set {R + v | v ∈ E}. The conflict set in the sphere is computed with respect to the geodesic metric in S (cf. Remark 2.15).

Theorem 3.27
Assume that 0 ∈ M X ∩ X where X is a pure one-dimensional closed definable set in the plane. Then C 0 (M X ) is the union of the bisectors of all the pairs of half-lines forming up C 0 (X ) and given by pairs of branches delimiting regions that contribute to M X at zero.
Proof Since M X is nowheredense, definable and 0 ∈ M X \ M X , it follows from the Curve Selection Lemma that dim 0 M X = 1. Therefore, the germ of M X at zero consists of finitely many branches (arcs) M i ending at the origin. Each of them gives a half-line, and the union of these half-lines forms the tangent cone C 0 (M X ).
Of course, each branch M i must lie between exactly two consecutive branches i,1 , i,2 of X . Moreover, by the triangle inequality, in the region delimited by two branches 1 , 2 of X , there cannot be more than one branch M i 20 . Therefore, we may restrict our considerations to the case when X has only two branches 1 , 2 , both of class C 121 , delimiting a region D in which the medial axis is a curve M ending at zero. From the definability, it follows that M may be assumed to be a C 1 curve and C 0 (M) is the tangent half-line at 0 ∈ M.
From [9] Theorem 4.13, we know that apart from a finite set of points in M, we have dim m(x) = 0 along M. Moreover, as m(x) varies continuously when M x → 0, we conclude that #m(x) = 2 for x ∈ M, for the points form rails on which the disc B(x, d(x, X )) rolls to zero, and so the rails must coincide with the two branches 22 .
In view of our previous results, the assumption 0 ∈ M X means that either 0 ∈ Sng 1 X , or X is superquadratic at zero. In both cases, it follows that no point in D has its distance to X realized in zero (cf. the previous proofs).
Since #m(γ (t)) = 2, we can invoke Lemma 3.3 to see that M near γ (t) coincides with the conflict set of the two branches. Thus, we are in a position that allow us to use the Birbrair-Siersma Theorem: the conflict set of the two points η i (t) in the circle S (γ (t), d(γ (t), X )) consists obviously of two antipodal points, since the cone spanned over them is the tangent cone C γ (t) (M) which must coincide with the tangent to M at γ (t). Still more, this line is clearly the bisector of the angle formed by the tangents to the circle at the points η i (t) (note that they cannot be parallel).
Of course, when t tends to zero, the tangent direction C γ (t) (M) approaches the tangent direction to M at zero. It follows that C 0 (M) must be the bisector of the tangent half-lines of the branches, as required.

Example 3.28
In the non-definable setting, the tangent cone C 0 (M X ) (when M X reaches the set X at zero) may be quite big. To ascertain this, consider Then M X near zero is clearly a curve lying between the two branches of X \ {0}. Since these branches have a common tangent [0, +∞) × {0} at zero, this line is also the tangent cone of M X at the origin.
From the last Theorem, we obtain a kind of symmetry property of plane analytic curves.

Corollary 3.30 Let X ⊂ R 2 be a real-analytic curve germ at zero and such that X \ {0} consists of only two branches and 0 ∈ M X . Then in a neighbourhood U of zero, the medial axis M X is a half-line that is a symmetry axis of X ∩ U .
Proof In view of the preceding results, there are two possibilities 23 : either 0 ∈ Sng 1 X , or 0 ∈ Reg 1 X ∩ Sng 2 X with X superquadratic at the origin. In the first case, by [14] Corollary 5.6, we know that C 0 (X ) is a half-line , that we may assume to be {0} × [0, +∞), whereas in the second one, it is a line L that we assume to be the x-axis. Using the definition of the tangent cone, we may assume in both cases that in a neighbourhood of the origin X is a graph over an interval (−ε, ε) in the x-axis. Consider F = 0 to be an analytic equation of X in the same neighbourhood.
Let h be the branch over (−ε, 0] and g the branch over [0, ε). They both are C 1 at zero and due to the Puiseux Theorem, for some integer p > 0, g(t p ) has an analytic extension through zero onto (−δ, δ) for some δ ∈ (0, ε). Then, we obtain Therefore, by the identity principle, this holds true for |s| < p √ δ. But we may repeat the same argument with h and so we conclude that g(−s) = h(s) for s ∈ (0, δ) (if δ was chosen < 1) which gives the symmetry sought after (since the germ of M X at zero depends only on the germ of X at this point) and proves that M X is a half-line near zero, as well.
Remark 3.31 It follows from this Corollary that, for instance, the superquadratic curve y = sgn(x)|x| 3/2 is not analytic at the origin.

Tangent Cone Method at C 1 -Singular Points
We begin with a not so obvious proof of an obvious fact:

Proposition 4.1 Let V ⊂ R n be a closed real cone with vertex at the origin and such that
(1) intV = ∅; (2) V is not contained in a hyperplane.
Proof It is sufficient to prove that C V = ∅ 24 since, firstly, C V = M V , and secondly, picking a point x ∈ C V , we may move the maximal ball B(x, d(x, V )) towards the vertex by homothety and it stays maximal.
By (1), there is a point x ∈ R n \ V . If x / ∈ C V , then we have exactly one closest point m(x) ∈ V . Now, we consider the balls Either t (x) is finite, in which case the corresponding centre belongs to C V , or t (x) = +∞ which means that V does not enter the open half-space H x := {y ∈ R n | y, x −m(x) > 0} when translated to m(x). But as V is a cone, we have H x ∩ V = ∅. If the latter occurs we say that H x is a supporting half-space for V .
Any open half-space is defined by a unique unit vector v ∈ S n−1 through the inequality y, v > 0, and we denote this half-space by H v .
For the rest of the proof, let us suppose that C V = ∅. Then by the preceding observation, the set then we would find a point w ∈ W \ V . It would readily imply that w is the centre of a maximal ball contrary to the assumptions. This is so because, by the assumptions, w has a unique closest point m(w), and so for v : which means that w ∈ H v , contrary to the choice of w.
Hence V = v∈P H v . This, however, contradicts the conjunction of (1) and (2). Indeed, we have just shown that V is a convex cone. Let k denote the maximal number of linearly independent vectors in V ∩ S n−1 . If k = n, then V must contain an n-dimensional simplex (formed by the n points on the sphere and the origin) and so has nonempty interior. Otherwise, if k < n, it follows that V is contained in a hypersurface.
Remark 4.2 By homothety, we easily see that for any closed cone V with vertex at a, M V is also a cone with a as the vertex.
Observe also that assumption (2) implies that V is nonlinear, i.e. not a vector subspace.
We need both assumptions in the Proposition above: Then V 2 is contained in a line of the plane and M V 2 = ∅.
It follows from the definition of the tangent cone C 0 (X ) that v ∈ C 0 (X ) \ {0} iff for any ε, δ > 0, In particular, if we assume that C 0 (X ) satisfies the assumptions of the previous Proposition, we see that, obviously, 0 ∈ Sng 1 X , and it is rather not astonishing that also 0 ∈ M X , as we will show in the next Theorem. Moreover, we could expect that then C 0 (M X ) = M C 0 (X ) .
The general idea is clear: we obtain the tangent cone by looking at X in the point 0 through a strong magnifying glass so that it becomes a set of half-lines; it is thence natural to expect that near 0 the medial axis of X should behave like the medial axis of the cone itself. Remark 4.4 Note that this does not solve the problem 0 ∈ Sng 1 X entirely since we do not consider the cases when C 0 (X ) is linear (like for the graph of z = y|x|) or degenerated (like for the horn x 2 + y 2 = z 3 ).
Not only this remark should stop our optimism, but also the following example: 5 We can hardly expect equality: let X be the union of the horn x 2 +y 2 = z 3 together with z = −||(x, y)||. Then V := C 0 (X ) consists of x = y = 0, z ≥ 0 together with z = −||(x, y)|| and so satisfies the assumptions of Proposition 4.1, but M X is the z-axis without the origin, so that C 0 (M X ) is the z-axis, whereas M V is just In view of this example, the best result we can have is the following one obtained using the main result of [10]: Theorem 4.6 Assume that X ⊂ R n is a definable hypersurface with tangent cone V = C 0 (X ) satisfying the assumptions of the Proposition 4.1. Then 0 ∈ M X and C 0 (M X ) ⊃ M V .
Proof As we are in the definable case, we know that V is the Kuratowski limit when t → 0 + of the dilatations (1/t)X , t > 0 (this follows from the Curve Selection Lemma). Hence by [10], But it is easy to see that M (1/t)X = (1/t)M X (by homothety) and so the limit inferior is actually a limit and coincides with C 0 (M X ). Finally, as observed in [12], for a definable set we have C 0 (E) = lim t→0 + (1/t)E also in the case when 0 / ∈ E in which case the limit is empty. Therefore, since we know by Proposition 4.1 that 0 ∈ M V , we obtain the result sought for.

Remark 4.7
It is possible to give a straightforward proof which, however, requires rather technical computations.

The Medial Axis Near C 1 -Smooth Points of Hypersurfaces
In this section, we assume that X = Reg 1 X is a C 1 codimension 1 submanifold. Then locally we can define at each point a ∈ X a continuous unit normal vector field ('exterior' or 'interior' depending on the side of X we choose) U ∩ X x → ν(x) ∈ S n−1 , where U is an appropriate neighbourhood of a such that U ∩ X is connected and is the graph of a C 1 function. We call such a neighbourhood admissible. Then we consider Recall that inf ∅ = +∞ so that we have L a (U ) ∈ [0, +∞]; L a (U ) is a Lipschitz constant for ν.
Let us note that for a smaller neighbourhood a ∈ U ⊂ U , there is L a (U ) ≤ L a (U ) so that if L a (U ) is finite, it remains finite for a basis of neighbourhoods of a. Remark 4.8 If the neighbourhood U is of the form V ×W ⊂ R n−1 ×R (with appropriately chosen coordinates) so that U ∩ X is the graph f of a C 1 function f : V → W , then if f is of class C 1,125 , we have L a (U ) < +∞ 26 .
Proof We may assume x / ∈ X , so that d(x) > 0. Take y, y ∈ m(x) and observe that we necessarily have x = y ± d(x)ν(y) = y ± d(x)ν(y ) with the same sign in both cases, for by assumption U ∩ X is a graph. Hence ||y − y || = d(x)||ν(y) − ν(y )|| and so y = y would imply L a (U ) ≥ 1/d(x) contrary to the assumption.
From this, we immediately obtain  25 meaning its derivative is Lipschitz. 26 The converse is more delicate as the function f (x) = √ x over (0, 1) is not C 1,1 , but L a (U ) < +∞ for a given a ∈ U = (0, 1) × R.

Remark 4.12
Let us observe that for a neighbourhood a ∈ U ⊂ U , there is r a (U ) ≥ r a (U ). Note also that r a (U ) = +∞ for some U iff X is contained in an affine hyperplane (and then r a (U ) = +∞ for any neighbourhood U of a). It is important to stress that we are looking at the intersection of the biballs with the whole of X , not only with U ∩ X . Proposition 4.13 a ∈ M X implies r a (U ) = 0 for all sufficiently small neighbourhoods U a.
Proof Observe that if r a (U ) > 0 for some U , then for any ball B(a, 2ρ) ⊂ U with 2ρ < r a (U ) each point x ∈ B(a, ρ) has its distance to X realized in B(a, 2ρ) ∩ X . Then we have necessarily #m(x) = 1 and so B(a, 2ρ) ∩ M X = ∅.
The local reach radius is closely related to L a (U ), provided it is bounded and its boundedness comes from the shape of X near a and not from other parts of X . To be more precise, the following Theorem 4.16 does not hold for X = R × {−1, 1} since r a (U ) = 1, but L a (U ) = 0 at all points and for all admissible U . Therefore, we introduce one more notion: Definition 4.14 We say that the local reach radius of X is intrinsically bounded at a, if for some admissible neighbourhood U of a there is r a (U ) < +∞ and for any r > r a (U ), we can find r > r > r a (U ) and a point b ∈ U ∩ X such that The same kind of computation leads from ||b − − c + || ≥ 2r to Note that and ||ν(b)|| = ||ν(c)|| = 1. Therefore, ((i) + (ii))/2 yields This implies that L a (U ) ≤ 1/r and so Now, suppose that r a (U ) is intrinsically bounded and there is no equality, so that we can find 1/L a (U ) > r > r a (U ).
In order to obtain a contradiction, we argue as follows. By the intrinsic boundedness, taking a smaller r if necessary, we can find a point There is a point c in this intersection, say, that c ∈ B(b + , r ) ∩ X , such that ||b + − c|| = d(b + , X ). But this distance is smaller than r < 1/L a , hence by Proposition 4.9 28 , we have m(b + ) = {c}. Moreover, for some u. In particular, b ∈ m(u) and for any x ∈ (u, b + ], b / ∈ m(x). Take a sequence (u, b + ] x ν → u. Then lim sup ν→+∞ m(x ν ) ⊂ m(u) (cf. Proposition 2.17), whence we can find a sequence m(x ν ) y ν → y 0 ∈ m(u). But d(x ν , X ) converges both to d(u, X ) = ||u − b|| and to ||u − y 0 || and so the latter is strictly smaller than r < 1/L a (U ). Proposition 4.9 implies that y 0 = b and m(u) = {b}.
We have Since X is C 1 , we have ν(y ν ) → ν(b) and so α ν → π/2 and β ν → 0. By the Sine Law, This leads to It remains to observe that, passing to the limit, on the one hand we get where the first inequality comes from the fact that u ∈ (b, b + ) and ||b − b + || = r , while on the other one, .
Summing up, (#) leads to a contradiction as wanted.

Remark 4.17
Up to now we have had no need for definability. If we suppose that X = f is definable, it readily implies that forν( is definable. Put ϕ(r ) := inf E r where E r is the r -section of E and let π(r, L) = r . Then ϕ(r ) = +∞ iff r / ∈ π(E) which implies that ϕ : (0, 1) → [0, +∞] is a definable function (cf. [10,Lemma 4.4]). This in turn means that ϕ has a well-defined limit L a := lim r →0 + ϕ(r ) 29 . According to the remark following the definition of L a (U ), ϕ is an increasing function, so that L a = inf r ∈(0,1) ϕ(r ). Remark 4.18 By Proposition 3.18, if X is superquadratic at a, then r a (U ) = 0 for any neighbourhood U of a. The converse is not true as we can see from the definable example of the graph of the C 1 function f (x, y) = y|x| 3/2 . Here, ord 0 f ≥ 2, so that f is not superquadratic at the origin, but at any point along the y-axis (apart from zero), f is superquadratic whence r 0 (U ) = 0 for any neighbourhood U of zero.
We can complete the discussion by the following result.

Theorem 4.19
For a hypersurface X with a ∈ Reg 1 X , the following conditions are equivalent: (1) for some neighbourhood U of a, there is r a (U ) > 0; (2) for some admissible neighbourhood U of a and some ε > 0, the segments ν ε (2). Since r a (U ) > 0, by Proposition 4.13 we conclude that a / ∈ M X which gives (3). In particular, in some neighbourhood V ⊂ U of a, m is univalued, and we may assume that m(V ) ⊂ U . Take 0 < ε < r a (U ) such that for any x ∈ V ∩ X , ν ε x ⊂ V where V ⊂ V is a possibly smaller neighbourhood of a. Now, suppose that for some distinct x, x ∈ V ∩ X , the segments ν ε x and ν ε x do intersect and let z be a point in the intersection. The distance d(z) is realized by a point x ∈ U ∩ X that may be different from x, x . Since there cannot be ||z − x|| = ||z − x || because of the univaluedness of m, we may assume that ||z − x|| > ||z − x ||. But then x lies inside the biball b(x, ε) contrary to the definition of r a (U ). Thus, (2) holds.
(2) ⇒ (3). Fix r > 0 such that B(a, 2r ) ⊂ U . Then for any z ∈ B(a, r ), there is m(z) ⊂ U ∩ X . If in addition we ask that d(z) < ε, then #m(z) = 1, for, given (3) ⇒ (1). Assume that (1) does not hold, i.e. r a (U ) = 0 for all neighbourhoods U of a. Let us introduce 30 By the definition, if 0 < r ν (x) < +∞, then x + r ν (x)ν(x) belongs to C X . In our case, for any U , there is a point x ∈ U such that either r ν (x), or r −ν (x) is finite.
As r a (U ) = 0 for arbitrary small neighbourhoods U , there are two possibilities: either there is a sequence X x k → a such that for any k, one of the two radii r ±ν (x k ) is finite, positive and it is possible to choose them so that they converge to zero-in which case a ∈ C X = M X , or there is a neighbourhood U a and a constant C > 0 such that a belongs to the closure of the set Now, if a ∈ U 0 , i.e. one of the radii r ±ν (a), say r ν (a), is zero, then for any r > 0, the point a is not the closest point to a(r ) := a + r ν(a). Of course, for small r , the point a(r ) has at least one closest point y(r ) ∈ U ∩ X and these points must converge to a when r → 0 + , for a(r ) → a. Since a(r ) − y(r ) are non-zero and normal to X at y(r ), we conclude that r ν (y(r )) > 0. Note that (a(r ) − y(r ))/||a(r ) − y(r )|| = ν(y(r )), because the points a(r ) are on the side of X designed by ν(a). If the radii r ν (a(r )) stayed separated from zero by a constant c > 0, then since the open balls B(y(r ), c) are disjoint with X and converge to B(a, c), we would conclude that B(a, c) ∩ X = ∅, contrary to r ν (a) = 0. Hence, r ν (y(r )) → 0, and so a is the limit of the points a(r ) ∈ C X , as required.
Next, suppose that a ∈ U C . We know that there is a sequence U 0 x k → a and, to each x k , we may apply the preceding reasoning in order to conclude that x k ∈ C X . Therefore, a ∈ M X , too. All these results show that (3) does not hold, and thus the proof is completed.

Reaching Radius
The previous subsection suggests some possible notions of reaching radius that could detect the approaching of M X . We are looking for a notion of radius of curvature that would detect the medial axis (the usual notion-too local-need not do this even in the C 2 smooth situation).
A kind of reach radius that immediately sees the approaching of the medial axis would be the following. Let N (X ) := x∈X N (x). Note that the union is disjoint and this set is the projection onto R n of the graph of x → N (x), hence it is definable. For any a ∈ X , we put Immediately we obtain Proposition 4.20 For any a ∈ X, ρ(a) = d(a, M X ), and so x → ρ(x) is definable.
Proof By Theorem 2.7, we know that M X = R n \ N (X ). Therefore, for a ∈ X , ρ(a) = sup r ≥ 0 | B(a, r ) ∩ M X = ∅ , which readily implies that ρ(a) = d(a, M X ). As we know that X and M X are definable, so is the distance to this set.

Corollary 4.21
For any a ∈ X , the following conditions are equivalent: Proof The equivalence of the two first conditions is clear, for the third one we invoke Theorem 2.7 again. Indeed, R n \ N (X ) = M X , but for any A ⊂ R n , there is int A = R n \ R n \ A, which accounts for the equivalence between conditions (2) and (3), as intN (X ) = R n \ M X .

Corollary 4.22
For any a ∈ X, ρ(a) > 0 iff δ(x) = d(x, X ) 2 is of class C 1 in a neighbourhood of a.
Proof By Clarke's results and our previous remarks, δ is of class C 1 in a neighbourhood of a iff ∂δ is univalued in this neighbourhood. But this is equivalent to saying that M X stays away from a by Theorem 2.23.

Remark 4.23
As observed in [15], δ may be of class C 1 even at points a ∈ Sng 1 X , e.g. for X = (−∞, 0] in R, that is the case. The number ρ(X ) := inf{ρ(a) | a ∈ X } corresponds to the reach introduced by Federer (see [14]).
A much more general approach is possible, partially inspired by Theorem 4.19. Consider a closed, definable, nonempty set X ⊂ R n . For a ∈ X and the normal cone N a (X ) we put V a := N a (X ) ∩ S n−132 .

Definition 4.24
We define the weak reaching radius is the directional reaching radius (or v-reaching radius). Next we put for the limiting reaching radius. Finally, we define the reaching radius as r (a) = r (a), a ∈ Reg 2 X, min r (a),r (a) , a ∈ Sng 2 X. Remark 4.25 If a ∈ int X , then N a (X ) = {0} and so V a = ∅ which gives r (a) = +∞ (as the infimum over the empty set).
Of course, if X is a hypersurface, then at a ∈ Reg 1 X , we have V a = {ν(a), −ν(a)} where ν is a local unit normal vector field.
The reason why we consider the biggest lower bound of the radii in all possible normal directions at a is to take into account the curvature and obtain a possibly finite number, e.g. for X = {y = x 2 } ⊂ R 2 we have r (0) = r (0,1) (0) = 1/2 < r (−1,0) (0) = +∞.

Example 4.29
It is rather hard to say something about X ∞ ∩ Sng 1 X as we can see from the following three examples: (1) Suppose X is described by y ≥ |x|. Then X ∞ = X (note that Sng 1 X is the boundary of X ). (2) Let X be the x-axis in R 2 without the open segment (0, 1). Then apart from the unique singular points (0, 0) and (1, 0) at which it is finite, the radius r is infinite. This shows that X ∞ need not be closed in X . (3) Let X be the x-axis in R 2 for x ≥ 0 together with y = 1/x for x > 0. Then along the hyperbola, the radius goes to infinity when we approach the y-axis, while at the origin (the unique singularity), it is finite.
Our main aim now is to prove the definability of the newly introduced radius r : X → [0, +∞]. Let us have a look at a general approach. For a definable set, X ⊂ R n the multifunction is definable (see, e.g. [12]), for its graph is described by a first-order formula involving definable sets: Similarly, the multifunction is definable. From this, we obtain the definability of the weak reaching radius as introduced in Definition 4.24:

Proposition 4.30
The set X ∞ = {x ∈ X | r (x) = +∞} is definable and so is the function r | X \X ∞ .
Proof This follows directly from the descriptions and the definability of θ and m. Indeed, which accounts for the definability of X ∞ . Observe that s ≤ sup{t ≥ 0 | x ∈ m(x + tv)} is equivalent to saying that x ∈ m(x + sv). Hence, r (x) = r < +∞ is equivalent to the condition which gives the definability of r on X \ X ∞ .
This settles the definability of r (x), x ∈ X . Finally, we apply the following general fact: where Z y denotes the y-section of the set Z and ϕ| E\{y} is the graph of the restriction ϕ| E\{y} . Consider the definable set Then for a fixed y ∈ F, the section G y = {(x, t) | (x, t, y) ∈ G} is ϕ| E\{y} .
Next, we observe that the set is definable, too. Note that the y-section h(y) y is exactly ( ϕ| E\{y} ) y . Finally, we have ψ(y) = inf h(y) y which ends the proof.
Proof From Proposition 4.31, we obtain the definability ofr (x), x ∈ Sng 2 X which together with Proposition 4.30 yields the definability of r (x) = min{r (x), r (x)}, x ∈ Sng 2 X and means that r (x) is definable as a function of x ∈ X .
We end with some more general properties of the introduced radius.
Proof Ad (1). The definability of X ∞ is a consequence of the definability of r (x) proved in the last Theorem. For a point x 0 ∈ M X and any y ∈ m(x 0 ), we have r (y) ≤ r v (y) = d(x 0 ) < +∞ where v = (x 0 − y)/||x 0 − y||. Thus, y ∈ X \ X ∞ .
Ad (2).This is a consequence of the previous considerations and Proposition 4.26 (1).
Ad ( The next and last theorem is related to Theorem 4.19. We would like to obtain an equivalence between the reaching of the point a ∈ X , i.e. a ∈ M X , and the vanishing of the radius: r (a) = 0. There are several problems that make this difficult.

Theorem 4.35
In the setting considered, a ∈ M X iff r (a) = 0.
Proof If a ∈ Reg 2 X , then a / ∈ M X , by the Nash Lemma ([9, Lemma 1.1]), and necessarily r (a) > 0. Therefore, we assume for the rest of the proof that a ∈ Sng 2 X .
Consider X ∞ = {x ∈ X | r (x) = +∞} and let W := {x ∈ R n | m(x) ⊂ X \ X ∞ }. Equivalently, W is described by the condition m(x)∩X ∞ = ∅. Observe that M X ⊂ W . Moreover, M X = ∅ (which is the case of interest to us) implies X \ X ∞ = ∅.
Take now a point x ∈ W \ X and a point y ∈ m(x). Then 0 = x − y ∈ N y (X ) and for v(x, y) := x−y ||x−y|| we have r v(x,y) (y) ∈ (0, +∞). Therefore, the point η y (x) := y + r v(x,y) (y)v(x, y) is well-defined. It is obvious that η y (x) ∈ C X . Actually, x ∈ M X iff for some (and then for any) y ∈ m(x), η y (x) = x. In this case, r v(x,y) (y) = d(x).
If a ∈ M X = C X , then there is a sequence (x ν ) ⊂ W \ X such that η y ν (x ν ) = x ν for some y ν ∈ m(x ν ) and x ν → a. Then by the semicontinuity of m, y ν → a. There are two possibilities: either y ν = a for any ν, in which case r (a) = 0 and so r (a) = 0, or (passing to a subsequence) y ν = a, in which caser (a) = 0 and r (a) = 0, as required. Now, let r (a) = 0. We will show that a ∈ M X . Since r (a) = min{r (a),r (a)}, we have two cases to consider.
(1) r (a) = 0. According to the definition inf{r v (a) | v ∈ V a } = 0 and there are two possibilities.
(a) There is a sequence (v ν ) ⊂ V a that we may assume to converge to some v ∈ V a (for it lives in S n−1 ) and such that the directional radii r v ν (a) → 0 but r v ν (a) > 0. Then the corresponding points a + r v ν (a)v ν belong to C X and converge to a. Hence a ∈ C X = M X .
(b) There is a decomposition V a = V 0 a ∪ V 1 a with V 0 a = ∅ and such that r v (a) = 0 for all v ∈ V 0 a , whereas r v (a) ≥ c > 0 for all v ∈ V 1 a where c > 0 is some constant. In this case, we pick a vector v ∈ V 0 a and observe that a / ∈ m(a + tv) for all t > 0. However, we may choose y(t) ∈ m(a + tv) and we get y(t) → a as t → 0 + . Moreover, it follows also that for v(t) = (a + tv − y(t))/||a + tv − y(t)|| we get r v(t) (y(t)) positive and finite.
Claim. v(t) → v as t → 0 + . Suppose the claim holds true. Then two things can happen.
(i) r v(t) (y(t)) → 0 as t → 0 + . Then y(t) + r v(t) (y(t))v(t) belong to C X and converge to a which ends the proof.
(ii) There is a constant C > 0 such that r v(t) (y(t)) ≥ C for all t > 0. Then the open balls B(y(t) + Cv(t), C) do not meet X and converge to the closure of B(a + Cv, C). By the convergence, the latter cannot meet X either. But this is a contradiction showing case (1)(b)(ii) cannot happen.
Before we turn to case (2) let us prove the Claim. First let us recall that a normal vector u ∈ N y (X ) ∩ S n−1 at y ∈ X is called proximal, if for some r > 0, y is the unique closest point to y + ru in X . This is equivalent to saying that for any x ∈ X , x − y, u ≤ (1/2r )||x − y|| 2 . Indeed, m(y + ru) = {y} is equivalent to ||y + ru − x|| > r for any x ∈ X \ {y}. After squaring both sides, this can be rewritten as (1/2r )||x − y|| 2 > x − y, u .
In our case, we know that the vectors v(t) are proximal. Let us take any decreasing sequence t ν → 0. We may assume that the unit vectors w ν := (y(t ν ) − a)/||y(t ν ) − a|| converge to some w. Of course, w ∈ C a (X ). Let us denote β ν := (y(t ν ) − a, v).
Then we observe that cos β ν → 0. Indeed, w ∈ C a (X ) implies that v, w ≤ 0. If there were v, w < 0, then we would have v, w ν < 0, i.e. cos β ν < 0 for all indices large enough. But this means that if we look at the triangle formed by the points a, y(t ν ), a + t ν v, we have d(a + t ν v) 2 = t 2 ν + ||y(t ν ) − a|| 2 − 2t ν ||y(t ν ) − a|| cos β ν > t 2 ν , for the term with the minus sign is negative. But this contradicts our assumption d(a + tv) < t for any t.