Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

On the r-dynamic coloring of subdivision-edge coronas of a path

  • Received: 28 April 2020 Accepted: 19 May 2020 Published: 22 May 2020
  • MSC : 05C15

  • This paper deals with the r-dynamic chromatic number of the subdivision-edge corona of a path and exactly one of the following nine types of graphs: a path, a cycle, a wheel, a complete graph, a complete bipartite graph, a star, a double star, a fan graph and a friendship graph.

    Citation: G. Nandini, M. Venkatachalam, Raúl M. Falcón. On the r-dynamic coloring of subdivision-edge coronas of a path[J]. AIMS Mathematics, 2020, 5(5): 4546-4562. doi: 10.3934/math.2020292

    Related Papers:

    [1] Cheng-Hung Huang, Tsung-Yi Lee . Predicting the optimal heating function for uniform exit temperature in a pipe flow. AIMS Mathematics, 2024, 9(1): 1997-2021. doi: 10.3934/math.2024099
    [2] Jie Liu, Bo Sang, Lihua Fan, Chun Wang, Xueqing Liu, Ning Wang, Irfan Ahmad . Symmetry, Hopf bifurcation, and offset boosting in a novel chameleon system. AIMS Mathematics, 2025, 10(3): 4915-4937. doi: 10.3934/math.2025225
    [3] Rattanasak Hama, Sorin V. Sabau . Randers metrics on two-spheres of revolution with simple cut locus. AIMS Mathematics, 2023, 8(11): 26213-26236. doi: 10.3934/math.20231337
    [4] Xiaohang Su, Peng Liu, Haoran Jiang, Xinyu Yu . Neighbor event-triggered adaptive distributed control for multiagent systems with dead-zone inputs. AIMS Mathematics, 2024, 9(4): 10031-10049. doi: 10.3934/math.2024491
    [5] Young Joon Ahn . G2/C1 Hermite interpolation of offset curves of parametric regular curves. AIMS Mathematics, 2023, 8(12): 31008-31021. doi: 10.3934/math.20231587
    [6] Mauro Costantini, Pierpaolo Soravia . On the optimal second order decrease rate for nonlinear and symmetric control systems. AIMS Mathematics, 2024, 9(10): 28232-28255. doi: 10.3934/math.20241369
    [7] Yujun Li . Characteristics of planar sextic indirect-PH curves. AIMS Mathematics, 2024, 9(1): 2215-2231. doi: 10.3934/math.2024110
    [8] Maryam T. Aldossary, Rashad A. Abdel-Baky . On the Blaschke approach of Bertrand offsets of spacelike ruled surfaces. AIMS Mathematics, 2022, 7(10): 17843-17858. doi: 10.3934/math.2022983
    [9] Li Dong, Jingyong Tang . New convergence analysis of a class of smoothing Newton-type methods for second-order cone complementarity problem. AIMS Mathematics, 2022, 7(9): 17612-17627. doi: 10.3934/math.2022970
    [10] Ghulam Mustafa, Syeda Tehmina Ejaz, Dumitru Baleanu, Yu-Ming Chu . The inequalities for the analysis of a class of ternary refinement schemes. AIMS Mathematics, 2020, 5(6): 7582-7604. doi: 10.3934/math.2020485
  • This paper deals with the r-dynamic chromatic number of the subdivision-edge corona of a path and exactly one of the following nine types of graphs: a path, a cycle, a wheel, a complete graph, a complete bipartite graph, a star, a double star, a fan graph and a friendship graph.


    Computing the surface at a constant distance from a curve or another surface is a fundamental operation in Geometry Processing [1], which plays a key role in engineering and manufacturing [2,3], or architectural design [4,5]. These surfaces also appear in the description of wavefronts propagating in a homogeneous medium.

    Pipe and offset surfaces can be regarded as the 3D generalization of planar offset curves (Figure 1). Given a distance d and a central curve S (also called spine [6]), a pipe or tube Sd is defined as the locus of points x at a distance d from points pS along normal lines N(p) to S. By replacing the spine with a base surface S (also known as progenitor), its offset Sd (dubbed parallel surface in classical differential geometry [7,8]) is defined in the same manner. These two families of surfaces are intimately related, as offsetting a pipe yields another pipe with the same spine. Their extension to a general n-dimensional space are both called offset. Also, throughout this paper, the unifying term progenitor will be employed to denote the spine, base surface, or the base curve when dealing with offsets to planar curves.

    Figure 1.  Planar offset curve and its 3D generalizations (pipe and offset surfaces).

    This explicit definition of pipes/offsets allows their construction and visualization. However, it requires a regular progenitor S, in the sense that S does not display singularities. Indeed, for pipes, we assume a spine S without cusps or self-intersections (Figure 2), so that we can define a tangent vector at each point of S and its the complementary normal plane. Similarly, the above definition of offset surfaces assumes a progenitor S with no singularities, such as cuspidal edges, cusps, or self-intersections, so that at each point of S a tangent plane is well-defined, and hence it makes sense to speak of normal directions. Observe that, if a progenitor surface S is connected and orientable, its offset consists of two components [8].

    Figure 2.  Singularities precluding a curve or surface from being regular.

    As an alternative to this explicit definition, we could characterize an offset implicitly for a general set S of points, not necessarily a regular curve or surface, as the level set at constant distance d from S. This survey employs this implicit form conceptually to determine the offset smoothness and will reveal the precise connection between the two offset versions (implicit and explicit), issues not clearly addressed in the existing literature.

    In general, a pipe or offset Sd is topologically more complex than its progenitor S since singularities may appear as d grows. The computation and detection of such singularities is a well-studied topic [2,9]. These singularities alter the original shape of S, so Alcázar and Sendra [10], and Alcázar [11], for plane algebraic curves and rational algebraic surfaces, respectively, put forward the topological concept of good local behavior, meaning that offsetting preserves the local shape. In the case of offsets to plane algebraic curves, this concept extends to good global behavior [12].

    In a real design scenario, we need the upper bound of d that guarantees the regularity of Sd. Before the advent of CAGD (Computer Aided Geometric Design), Federer [13] published a seminal work on sets with positive reach that deserves renewed attention. He extended the concept of normal vectors to deal with convex sharp edges and vertices, which enriches the admissible geometries for explicit offset construction. He showed that offsetting any closed set S yields a C1-smooth surface, for distances d<R, where R denotes the so-called reach of the set S. In a CAGD setting, Maekawa et al. [6], and Wallner et al. [14] compute this bound for C2 pipes and offsets, respectively, by carefully analyzing all possible global and self-intersections. This bound plays a fundamental role in the construction of reliable (topologically equivalent) approximations to Sd [6,15] and, in the case of the offset to compact surfaces, it coincides with minimal distance to the cut locus of the surface, i.e., the set of points equally distant from at least two points on the surface. Thus, these works show how to compute the reach (in the closed case), albeit without employing this terminology.

    Although a rich literature exists on detecting singularities of pipes and offsets, surprisingly, their general smoothness has received scant attention. Our contribution focuses on clarifying how it depends on that of the progenitor by bringing together existing yet dispersed concepts, making them more accessible, and deriving the relevant results the applied mathematics community needs.

    The most remarkable result regarding the smoothness of offset surfaces is due to Hermann [16]. In CAGD, surfaces are usually defined parametrically in a piecewise manner, and their smoothness is characterized by the so-called geometric continuity Gk [17], which means the agreement of i-th derivatives (i=0,,k) at the joints of adjacent Ck patches, after suitable reparameterization. For a piecewise base surface composed of C patches, joined with geometric continuity Gk along a common boundary, such as non-degenerate NURBS [18,19], Hermann proves that the offset inherits the Gk continuity. His approach relies on checking the existence of the above-mentioned reparameterization, yet without explicitly constructing it.

    To derive a more general result, we assume no particular representation (implicit or parametric) of the progenitor, vindicate Federer's results, and extend them to Ck progenitors, so the paper is arranged as follows. In Section 2, we introduce the different geometries (sets of points) required for a unified handling of progenitors and resulting pipes and offsets. We begin with the classical concept of smooth submanifolds and extend them to sets of positive reach in Federer's framework involving the cone of normal vectors. Next, in Section 3, we define the untrimmed offset as the set obtained by displacing points of S a constant distance d along normal lines, and the trimmed offsets as the level set at distance d. In Section 4, we review the concept of reach and associated results noting that, if d<R, trimmed and untrimmed offset coincides. In Section 5, we employ existing results on the smoothness of the distance function to a closed Ck submanifold to show that, if d<R, then Sd inherits the class Ck of S. Finally, conclusions are drawn in Section 6.

    Rather than in the constructional way of geometric continuity, we will characterize the smoothness of pipe/offset surfaces by defining them as a subset of points fulfilling certain conditions. For this purpose, we could employ the classical concept [20] of surface of class Ck in R3, or, for a more comprehensive scope, that of submanifold of class Ck [21], in Euclidean space Rn:

    Definition 1. Let m,n be integers such that 1m<n. A subset SRn is a m-dimensional submanifold of class Ck, k1, if either of the following equivalent conditions [21] is fulfilled:

    (i) For each point xS there is an open neighborhood URn and a homeomorphism X:VRmSU of class Ck such that the differential dX has rank=m for all points in U.

    (ii) For each point xS there is an open neighborhood U and a local function F:URnRnm of class Ck such that F1(0)=SU and the differential dF has rank=nm for all points over SU.

    Characterization (i) requires the existence of a local parametrization X of class Ck around every point xS, whereas (ii) requires that S be defined locally by an implicit equation F(x)=0, with F of class Ck.

    Remark 1. For k=1, the first characterization reduces to that of a regular surface. Therefore, this concept of class extends the notion of regularity.

    Remark 2. The concept of Ck class, stronger than that of Ck curves or surfaces employed in CAGD, encompasses the case of regular Gk piecewise surfaces: according to characterization (i), they are of class Ck.

    Remark 3. For hypersurfaces (m=n1), in characterization (ii) dF simplifies to dF=F, with F0. Later, we will come across the so called hypersurfaces of class C1,1 [23], weaker than C2, but stronger than C1:

    Definition 2. A C1,1 hypersurface is a (n1)-dimensional submanifold characterized by a C1,1 implicit function F, i.e, such that F is 1-Lipschitz.

    CAGD applications such as solid modeling [22] deal with a region of Rn, rather than a hypersurface. The closed set bounded by a hypersurface (without boundary) corresponds to the concept of n-dimensional manifold with boundary. A general and formal definition for submanifolds of arbitrary dimension with boundary is found in the classical book [21]. The particular case of a n-dimensional manifold with boundary is, in essence, a set locally diffeomorphic to the half-space Hn=[0,)×Rn1.

    The concept of submanifold allows a unified handling of smooth progenitor curves and surfaces, and hence of the resulting pipes and offsets. However, it excludes progenitors with singularities, a severe restriction in solid modeling. For instance, a simple polyhedral solid does not qualify as a submanifold. Federer's work provides a more general setting by extending the concept of tangent and normal lines [13,24]:

    Definition 3. The tangent cone of vectors Tan(p,S) at each point pS of a given set SRn consists of the limits of all (secant) vectors originating from p and passing through a sequence of points piS p that converges to p. The corresponding dual cone of normal vectors Nor(p,S) consists of all vectors v such that u,v0 whenever uTan(p,S).

    This elegant framework extends beyond the submanifold realm to the so-called sets with positive reach. Although the concept of reach will be formally in Section 4, we advance that these sets are characterized [25,26] by admitting a value R>0 such that we can roll up a ball of a radius d<R all over the boundary S. Thus, they encompass the following closed sets SRn (Figure 3):

    Figure 3.  Example of sets S with positive reach: a) Submanifold. b) n-dimensional submanifold S with boundary S. c) Set with convex sharp edges or vertices.

    a) Traditional submanifolds S (without boundary): The cone Nor(p,S) coincides with the customary normal direction that, in Definition 1, the conditions on the rank guarantee.

    b) n-dimensional submanifolds S with boundary S: The cone consists of the outward normal vectors to S.

    c) Closed sets whose boundary S may contain convex sharp edges and vertices: At these singularities, the cone (highlighted in orange in Figure 3c) fills the gaps between the normal directions of adjacent faces. In [27], the term normal pyramid is employed instead to denote this cone.

    In the general framework of Section 2.2, from Definition 3 we can construct the normal bundle of a given set S:

    ν(S):={(p,v)Rn×Rn: pS and vNor(p,S)}. (3.1)

    and the map σ:

    σ:ν(S)Rn,σ(p,v)=p+v. (3.2)

    We assume that pS the cone Nor(p,S) does not degenerate to a null vector v=0, so that the above concepts make sense. Consequently, we exclude sets whose boundary contains sharp concave edges or vertices.

    Now, we are ready to give a formal definition of the explicit offset, dubbed untrimmed in contrast to its trimmed (level set) sibling:

    Definition 4. The untrimmed offset Sd at distance d to S is the set constructed by displacing all points pS a constant distance d along normal lines N(p):

    Sd:={σ(p,v)Rn : (p,v)ν(S) and  v=d}. (3.3)

    Remark 4. This definition encompasses pipes Sd, generated from a submanifold S of dimension m=1 (a curve).

    Remark 5. When S is a solid with convex sharp edges and vertices, such as the cone of Figure 4, Sd (3.3) includes the resulting vertex and edge offsets. These components (highlighted in orange) fill the gaps between face offsets (blue), making up the topology Farouki [28] identified.

    Figure 4.  Offsetting a solid cone S with a sharp edge and vertex.

    Since the map σ (3.2) is Ck1 [29], we could jump to the conclusion that a Ck submanifold S generates another Ck1 submanifold Sd (3.3). However, on the one hand we must constrain values d to ensure that Sd actually meets the definition of submanifold, because Sd may have singularities, such as the self-intersections of the inner component of the planar offset in Figure 5a. These singularities substantially alter the shape of the original progenitor S. On the other hand, this class can be improved to Ck.

    Figure 5.  a) Untrimmed offset Sd vs. b) Trimmed offset (level set).

    To characterize the smoothness of Sd (3.3), the key idea is using an alternative offset construction, what Farouki [30,31] calls trimmed or true offset:

    Definition 5. Given a non-empty set S, its trimmed offset at distance d is the level set δ1(d,S) of the distance function δ to S:

    δ:RnR,δ(x,S)=infpSxp, (3.4)

    When no ambiguity is possible, we drop the symbol S in (3.4) and upcoming definitions. The catch is that, once again, δ1(d) may display singularities (Figure 5b). Furthermore, δ1(d) does not always coincide with its untrimmed counterpart Sd (3.3), since Sd may contain points x at distance δ(x,S)<d, points trimmed away [12,32,33,34,35] in δ1(d). In the example of Figure 5b, the inner component of δ1(d) would even vanish for a large d. The concept of reach of a set, reviewed in the upcoming Section, will elucidate the connection between the offsets Sd and δ1(d), i.e., Definitions 4 and 5.

    Definition 6. Given a set S, we denote U(S) the set of all xRn with the unique nearest point property, i.e., xU(S), there is a unique point π(x,S)S such that δ(x)=xπ(x,S). The map π is called the nearest point function, or projection onto S:

    π:U(S)S. (4.1)

    Definition 7. For points pS, if Br(p) denotes the open nball of radius r centered at p, then the local reach(p,S) around p and global reach(S) are defined as:

    reach(p,S):=sup{r:Br(p)U(S)},R=reach(S):=infpSreach(p,S). (4.2)

    We say that a set S has positive reach if R>0. Geometrically [25,26], as already noted, this property means that we can roll up a ball of radius at most R all over the boundary S.

    All sets with positive reach are necessarily closed [13], so, from now on, we restrict ourselves to closed sets S. Thus, R admits a more familiar interpretation [41,42], using the complement RnU(S), i.e., the set of points having more than one nearest point. This complement set corresponds to the so-called cut locus L=L(S) (without its limits points) [14,25,36,37]. In terms of L, the local and global reach (4.2) are given by (Figure 6a):

    reach(p,S)=δ(p,L),R=infpS,qLpq. (4.3)
    Figure 6.  a) Local reach(p,S) and global reach R. b) Projection π(x).

    Consequently, positive reach is tantamount to saying that L(S) does not touch S [25].

    Equipped with the above definitions, we show that the reach R determines when Sd and the level set δ1(d) coincide. For closed sets, Theorem 4.8 in [13] furnishes two fundamental results:

    (i) The projection (4.1) occurs always along a normal line N(p) to S, as Figure 6b sketches:

    xπ(x)=vNor(π(x),S),xU(S). (4.4)

    (ii) Moving from p along N(p) up to a distance reach(p,S), all points x project onto p, and hence the distance δ(x,S) is precisely along N(p). In terms of the map σ (3.2):

    π(σ(p,v))=pδ(σ(p,v))=v,forv<reach(p,S). (4.5)

    Result (i) means that δ1(d)Sd, whereas (ii) implies that, for d<reach(S), then Sdδ1(d) and SdU(S). Let us summarize these relationships:

    Theorem 1. Let S be a closed set with reach(S)=R>0. Then, for d(0,R), its untrimmed offset Sd (3.3) at distance d coincides with the level set δ1(d), and SdU(S).

    Remark 6. This Theorem can be regarded as the generalized version, to sets with positive reach, of Corollary 8 in [15], formulated for the offset to compact C2 surfaces. Sakkalis et al. [15] do not employ the terminology reach to denote the upper bound of the size of the neighborhood enjoying the unique nearest points property. However, and more importantly, they give a practical recipe for its numerical computation.

    In general, both the local and global reach improve when we consider a set S instead of its boundary S (Figure 7a). Indeed ([13], Remark 4.2), for points pS:

    reach(p,S)reach(p,S)reach(S)reach(S). (4.6)
    Figure 7.  a) Reach R of a closed set S bounded by S. b) Effect of a sharp edge or vertex.

    A sharp edge or vertex in S (Figure 7b) implies that L(S) touches S, so reach(S)=0, whereas S may still have positive reach. If S is the interior region bounded by S, then, in terms of cut loci, L(S) contains only the exterior of L(S), i.e., excluding its interior component, which coincides with the medial axis of S [25,36,37]. The medial axis can hence be defined as the closure of the locus of centers of maximal balls inscribed in S [2,31,36,37]. The exterior component of L(S) is involved in trimming the outer offsets to the solid S, whereas offsets inside the pocket S are trimmed against the medial axis [31,38,39,40]. A warning: in [41,42], and also in [43] in a submanifold context, the term medial axis is used instead to denote the cut locus, but the terminology we follow is more widespread [2,25,31,36,37,38,39,40,44,45].

    A remarkable case is the generalized tubular neighborhood

    Sr:={x:δ(x,S)r},r<reach(S), (4.7)

    called r-offset in [41,42]. Corollary 4.9 in [13] relates the properties of Sr and S:

    δ(x,Sr)=δ(x,S)rwheneverδ(x,Sr)r,reach(Sr)reach(S)r. (4.8)

    In particular, we are interested in the case where S is a spine and hence Sr is bounded by a pipe Sr, as Figure 8 illustrates at a normal section through a point pS. Combining relationships (4.8) and Theorem 1, we formalize the relationship between pipes and their offsets mentioned in the Introduction:

    Figure 8.  Set Sr bounded by a tube Sr.

    Lemma 1. Let Sr be the r-offset (4.7) bounded by the pipe Sr. Then, the offset to Sr at a distance (dr), with r<d<reach(S), coincides with the level set δ1(dr,Sr) and the pipe Sd=δ1(d,S).

    We recall the well-known result on the reach of general m-dimensional submanifolds [26,29,46]:

    Lemma 2. Compact C2 submanifolds have positive reach R>0.

    Violating either of the conditions required in this Lemma may lead to a zero reach:

    a) The planar curve S of Figure 9a, adapted from [21], illustrates the unbounded case. As S tapers off to infinity along an asymptote contained in L, the points pS get closer and closer. Consequently, reach(p,S)0 and R=0.

    Figure 9.  Examples of curves S with zero reach: a) Unbounded case with convergence at both sides to a common asymptote. b) C1 graph of y(x)=|x|3/2.

    b) Figure 9b shows that a C1 curve may have points p with zero reach, contrary to intuition. Consider the graph of the C1 function y(x)=|x|3/2, an example taken from [46,47] and clearly a C1 curve. If we draw the normal lines to S of constant length d>0 (upper side), no matter how small d is, if we zoom in near the origin O, there exists an interval x[ϵ,ϵ] such that the normals at f(x) intersect. Therefore, O does not admit any neighborhood with the unique nearest point property, i.e., reach(O,S)=0. Equivalently by (4.3), L (the non-negative vertical semi-axis) touches O.

    Remark 7. By inequality (4.6), Lemma 2 carries over to n-dimensional submanifolds S with compact C2 boundary.

    Remark 8. For compact hypersurfaces S, Lucas [23] proved that the C2 condition can be relaxed, since S is of positive reach if and only if it enjoys C1,1 continuity.

    As a consequence of Theorem 1, given a closed set S the function

    F(x)=δ(x)d (5.1)

    characterizes Sd as a submanifold according to Definition 1(ii). Since F=δ, the smoothness of the distance function δ carries over to Sd. Whereas Federer [13] already analyzed the differentiability of the distance function δ to general closed sets, the smoothness of higher derivatives is well-studied in the setting of submanifolds of class Ck. Thus, we proceed with a separate analysis for general closed sets, which include closed C1 submanifolds, and smoother Ck submanifolds, k2.

    For general closed sets, it is well-known that δ(x) enjoys Lipschitzian character everywhere but SL(S), as Federer [13] (Theorem 4.8) proved:

    Theorem 2. Let SRn be a nonempty closed set. Then, on Int(U(S)S) the distance (3.4) δ(x) to S is a C1,1 function with gradient:

    δ(x)=xπ(x)δ(x)0,xInt(U(S)S). (5.2)

    In a CAGD setting, Wolter [36] rederived this result, without reference to Federer's work. For d<R, Theorem 2 implies a C1,1 function F (5.1) and, by invoking Definition 2, the C1,1 class of the trimmed offset δ1(d). Since trimmed and untrimmed offset Sd coincide (Theorem 1), Sd inherits this class [13,42]:

    Corollary 1. Let S be a closed set with positive reach R>0. Then, its offset Sd at distance d(0,R) is a C1,1 hypersurface.

    Remark 9. In the case of a closed set S with sharp edges and vertices, hence not eligible as a smooth submanifold, Corollary 1 implies that offsetting with d<R improves the smoothness. Figure 4 illustrates this property with a solid cone S, which enjoys R= for being a convex set [13], thereby admitting a C1,1 offset Sd for any d.

    Regarding the smoothness of the distance to Ck submanifolds, k2, at first glance, δ seems Ck1, since δ is always continuous and expressible in terms of the direction normals to S. However, Gilbarg and Trudinger [48] first noted that, for hypersurfaces, δ is actually Ck in a certain neighborhood of S when k2. By incorporating Federer's work, Krantz and Parks [47] added the case k=1, whereas Foote [29], with an elegant coordinate-free proof, extended the result to general submanifolds:

    Lemma 3. Let S be a compact Ck submanifold, with k2. Then, it admits a generalized tubular neighborhood SrU(S) such that the distance δ(x,S) is Ck for xInt(SrS).

    Krantz and Parks provide another proof in [49] and, in Section 4.4 of their book [46], summarize the most relevant results on the smoothness of δ. Also, the survey by Jones et al. [25] on distance fields briefly reviews the differentiability of the distance function.

    The main shortcoming of Lemma 3, limiting their applicability to characterize the smoothness of pipes/offsets, is that it does not specify the size r of the tubular neighborhood. However, when S is a Ck hypersurface, it can locally be expressed as the graph of a Ck function [21], which leads to the more specific result about r. Giusti [50] (Appendix B), adapting the original result by Gilbarg and Trudinger [48] and without citing Federer's paper [13], proves that δ(x,S) to a compact set S bounded by a Ck submanifold is Ck, for distances δ(x,S)<R such that points x have a unique nearest point and property (4.4) applies. Extending the argumentation to the boundary by considering its normal space in (4.4), since this bound is precisely R=reach(S), we can rewrite Giusti's result in a more precise way by quantifying r:

    Lemma 4. Let S be a compact Ck hypersurface, with k2. Then, it has reach R>0 and the distance δ(x) is Ck for points x such that δ(x)(0,R).

    Lemma 4 is still incomplete for our purposes, as it only applies to hypersurfaces, not to general m-dimensional submanifolds. To find a more powerful result, we make a short foray into Riemannian geometry [51] and extend our setting, replacing Rn and the Euclidean distance d with a general n-dimensional Riemannian space M and its induced inner metric. The concepts of submanifold, unique nearest point property [52], set of positive reach [53] and hence cut locus extend to this new framework. Moreover, Mantegazza and Mennucci [54] (Proposition 4.6, point 7) derive the equivalent of Theorem 2 for Ck submanifolds. For our purposes, where M=Rn, their remarkable result particularizes as follows:

    Theorem 3. Let S be a closed Ck submanifold, with k2. Then, the distance δ(x) is Ck for points x everywhere but L(S)S.

    Remark 10. With respect to Lemmas 3, 4, Theorem 3 relaxes the condition on S, from compact to closed. However, it no longer guarantees R>0, as the unbounded curve in Figure 8a illustrates.

    With a similar argumentation to that leading from Theorem 2 to Corollary 1, from Theorem 3 we derive the sibling of Corollary 1 for closed Ck progenitors:

    Corollary 2. Let S be a closed Ck progenitor with k2 and of positive reach R>0. Then, its offset Sd at distance d(0,R) is a Ck hypersurface.

    Remark 11. Corollary 2 applies, with improved reach (4.6), to the offset to an ndimensional submanifold with Ck boundary. It also implies that offsetting with d<R keeps the smoothness of S. Figure 10 illustrates this property in the case k=2, with the C2 tube Sd generated from a C2 spine S, defined as a periodic cubic B-spline [3] from its control polygon. Figure 11 shows another example, namely offsetting a solid (i.e., a 3-dimensional submanifold) with C2 boundary, using a commercial solid-modeling system. This operation yields a C2 offset surface if d<R, whereas trying a value dR triggers a system error, warning that the resulting geometry is unsupported.

    Figure 10.  C2 tube Sd constructed from a C2 spine S (periodic cubic B-spline).
    Figure 11.  Offsetting a solid S bounded by a C2 surface.

    To analyze the smoothness of a pipe or offset Sd, at distance d from a progenitor S, we have brought together and adapted existing concepts and results, especially those from Federer's pioneering paper [13] on sets with positive reach. This work is usually overlooked in the literature on CAGD, with few exceptions [41,42,43], as well as in classical books on differential geometry [7,8] when dealing with tubes and offsets. On the other hand, the mathematical research on the smoothness of the distance function to submanifolds does not focus on the construction of pipes/offsets and seems unaware of the CAGD applied results on their regularity.

    The reach R of S, i.e., the minimal distance from S to its cut locus, plays the key role. For closed sets S with positive reach, the condition d<R guarantees:

    ● The coincidence between two offset versions: the explicit untrimmed offset Sd (obtained by displacing points of S a constant distance d along normal lines) and the trimmed offset (level set δ1(d) of the distance δ to S).

    ● The containment of Sd in a neighborhood with the unique nearest point property, i.e., that any point has a unique point on the progenitor at minimal distance.

    ● That Sd is a C1,1 hypersurface. If S is a submanifold of class Ck (or the region bounded by a closed Ck hypersurface), this class is inherited by the distance function to S and hence by Sd. Hence, offsetting with d<R improves or keeps the smoothness of S.

    Sets with R>0 are hence those admitting a singularity-free offset for d<R. Along with compactness, a C2 class of a submanifold implies R>0, but, contrary to intuition, C1 smoothness does not.

    Unlike the most relevant previous work [16] on higher-order smoothness of offset surfaces, our results hold for general closed progenitors of class Ck, not necessarily piecewise made up of C patches with Gk joints along common boundaries. Also, they hold in Euclidean space Rn of arbitrary dimension n, for pipe or offset hypersurfaces Sd, at constant distance d from a progenitor spine or hypersurface.

    Our discussion applies only to the classical offset to a hypersurface, that is, along its normal. We do not consider the so-called generalized offsets [55,56,57,58], i.e., with translation along a vector different from the normal. Admittedly, a generalized offset to S can be rewritten as a standard offset Sd (at constant distance d) to a new progenitor ˆS [59,60]. However, ˆS involves tangents and normals to Sd. Consequently, a progenitor S of class Ck generates a new ˆS of class only Ck1.

    This research was supported by grant PID2019-104586RB-I00 funded by MCIN/AEI/10.13039/501100011033; grant SBPLY/19/180501/000247 by Consejería de Educación Cultura y Deportes (Junta de Comunidades de Castilla-La Mancha); and grant 2021-GRIN-31214 by Univ. de Castilla-La Mancha; co-financed by the ERDF (European Regional Development Fund). We are grateful to a referee for their valuable suggestions, which substantially improved this article.

    The authors declare that there is no conflict of interest.



    [1] R. Frucht, F. Harary, On the corona of two graphs, Aequationes Math., 4 (1970), 322-325. doi: 10.1007/BF01844162
    [2] P. Lu, Y. Miao, The generalized characteristic polynomial of the subdivision-vertex and subdivision-edge coronae, Ars Combin., 129 (2016), 341-356.
    [3] E. T. Baskoro, I. A. Purwasih, The locating-chromatic number for corona product of graphs, Southeast-Asian J. Sci., 1 (2012), 126-136.
    [4] S. A. U. H. Bokhary, T. Iqbal, U. Ali, Game chromatic number of Cartesian and corona product graphs, J. Algebra Comb. Discrete Struct. Appl., 5 (2018), 129-136.
    [5] Dafik, I. H. Agustin, D. A. R. Wardani, et al. The r-dynamic chromatic number of corona of order two of any graphs with complete graph, Journal of Physics: Conference Series, 1306 (2019), 012046.
    [6] H. Furmanczyk, M. Kubale, Equitable coloring of corona products of cubic graphs is harder than ordinary coloring, Ars Math. Contemp., 10 (2016), 333-347. doi: 10.26493/1855-3974.687.99b
    [7] M. I. Huilgol, V. Sriram, On the harmonious coloring of certain class of graphs, J. Comb. Inf. Syst. Sci., 41 (2016), 17-29.
    [8] K. Kaliraj, R. Sivakami, J. Vernold Vivin, Star edge coloring of corona product of path and wheel graph families, Proyecciones, 37 (2018), 593-601. doi: 10.4067/S0716-09172018000400593
    [9] K. Kaliraj, V. J. Veninstine, V. J. Vernold, Equitable coloring on corona graph of graphs, Journal of Combinatorial Mathematicsand Combinatorial Computing, 81 (2012), 191-197.
    [10] A. I. Kristiana, Dafik, M. I. Utoyo, et al. On r-dynamic chromatic number of the corronation of path and several graphs, Int. J. Adv. Eng. Res. Sci., 4 (2017), 96-101. doi: 10.22161/ijaers.4.4.13
    [11] A. I. Kristiana, M. I. Utoyo, Dafik, The lower bound of the r-dynamic chromatic number of corona product by wheel graphs, AIP Conference Proceedings, 2014 (2018), 020054.
    [12] A. I. Kristiana, M. I. Utoyo, Dafik, On the r-dynamic chromatic number of the corronation by complete graph, J. Phys. Conf. Ser., 1008 (2018), 012033.
    [13] A. I. Kristiana, M. I. Utoyo, R. Alfarisi, et al. r-dynamic coloring of the corona product of graphs, Discrete Math. Algorithms Appl., (2020), 2050019.
    [14] S. Mohan, J. Geetha, K. Somasundaram, Total coloring of the corona product of two graphs, Australasian J. Combinatorics, 68 (2017), 15-22.
    [15] F. A. Muntaner-Batle, J. Vernold Vivin, M. Venkatachalam, Harmonious coloring on corona product of complete graphs, Nat. Acad. Sci. Lett., 37 (2014), 461-465. doi: 10.1007/s40009-014-0256-1
    [16] N. Ramya, On coloring of corona graphs, Indian J. Sci. Technol, 7 (2014), 9-11.
    [17] J. V. Vivin, M. Venkatachalam, The b-chromatic number of corona graphs, Util. Math., 88 (2012), 299-307.
    [18] T. Pathinathan, A. A. Mary, D. Bhuvaneswari, b-chromatic number of subdivision edge and vertex corona, Int. J. Comput. Algorithm, 3 (2014), 44-47. doi: 10.20894/IJCOA.101.003.001.011
    [19] B. Montgomery, Dynamic coloring of graphs, ProQuest LLC, Ann Arbor, MI: Ph.D Thesis, West Virginia University, 2001.
    [20] H.-J. Lai, B. Montgomery, H. Poon, Upper bounds of dynamic chromatic number, Ars Combin., 68 (2003), 193-201.
    [21] I. H. Agustin, D. Dafik, A. Y. Harsya, On r-dynamic coloring of some graph operation, Int. J. Combin., 1 (2016), 22-30.
    [22] S. Akbari, M. Ghanbari, S. Jahanbekam, On the dynamic chromatic number of Cartesian product graphs, Ars Combin., 114 (2014), 161-167.
    [23] M. Alishahi, On the dynamic coloring of graphs, Discrete Appl. Math., 159 (2011), 152-156. doi: 10.1016/j.dam.2010.10.012
    [24] Dafik, D. E. W. Meganingtyas, K. D. Purnomo, et al. Several classes of graphs and their r-dynamic chromatic numbers, Journal of Physics: Conference Series, 855 (2017), 012011.
    [25] S. Jahanbekama, J. Kim, O. Suil, et al. On r-dynamic coloring of graphs, Discrete Appl. Math., 206 (2016), 65-72. doi: 10.1016/j.dam.2016.01.016
    [26] R. Kang, T. Müller, D. B. West, On r-dynamic coloring of grids, Discrete Appl. Math., 186 (2015), 286-290. doi: 10.1016/j.dam.2015.01.020
    [27] H.-J. Lai, B. Montgomery, Z. Tao, et al. Conditional colorings of graphs, Discrete Math., 306 (2006), 1997-2004. doi: 10.1016/j.disc.2006.03.052
    [28] S. Loeb, T. Mahoney, B. Reiniger, et al. Dynamic coloring parameters for graphs with given genus, Discrete Appl. Math., 235 (2018), 129-141. doi: 10.1016/j.dam.2017.09.013
    [29] A. Taherkhani, On r-dynamic chromatic number of graphs, Discrete Appl. Math., 201 (2016), 222-227. doi: 10.1016/j.dam.2015.07.019
    [30] S. Akbari, M. Ghanbari, S. Jahanbekam, On the list dynamic coloring of graphs, Discrete Appl. Math., 157 (2009), 3005-3007. doi: 10.1016/j.dam.2009.05.002
    [31] S. J. Kim, W. J. Park, List dynamic coloring of sparse graphs, International Conference on Combinatorial Optimization and Applications, 6831 (2011), 156-162. doi: 10.1007/978-3-642-22616-8_13
    [32] S.-J. Kim, B. Park, List 3-dynamic coloring of graphs with small maximum average degree, Discrete Math., 341 (2018), 1406-1418. doi: 10.1016/j.disc.2017.09.025
    [33] H.-J. Lai, X. Lv, M. Xu, On r-hued colorings of graphs without short induced paths, Discrete Math., 342 (2019), 1904-1911. doi: 10.1016/j.disc.2019.03.017
    [34] W.-Q. Li, J.-B. Li, L.-Y. Miao, et al. On r-hued coloring of planar graphs with girth at least 5, Util. Math., 109 (2018), 303-312.
    [35] H. M. Song, S. H. Fan, Y. Chen, et al. On r-hued coloring of K4-minor free graphs, Discrete Math., 315 (2014), 47-52.
    [36] H. M. Song, H. J. Lai, J. L. Wu, On r-hued coloring of planar graphs with girth at least 6, Discrete Appl. Math., 198 (2016), 251-263.
    [37] H. Zhu, S. Chen, L. Miao, et al. On list r-hued coloring of planar graphs, J. Comb. Optim., 34 (2017), 874-890. doi: 10.1007/s10878-017-0118-0
    [38] J. Zhu, Y. Bu, List r-dynamic coloring of graphs with small maximum average degree, Discrete Appl. Math., bf 258 (2019), 254-263.
  • This article has been cited by:

    1. Feifei Qu, Xin Wei, Limit behaviour of constant distance boundaries of Jordan curves, 2022, 7, 2473-6988, 11311, 10.3934/math.2022631
    2. Javier Sánchez-Reyes, Self-Intersections of Cubic Bézier Curves Revisited, 2024, 12, 2227-7390, 2463, 10.3390/math12162463
  • Reader Comments
  • © 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(6698) PDF downloads(344) Cited by(6)

Figures and Tables

Figures(9)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog