The Existence of a Convex Polyhedron with Respect to the Constrained Vertex Norms

Given a set of constrained vertex norms, we proved the existence of a convex configuration with respect to the set of distinct constrained vertex norms in the two-dimensional case when the constrained vertex norms are distinct or repeated for, at most, four points. However, we proved that there always exists a convex configuration in the three-dimensional case. In the application, we can imply the existence of the non-empty spherical Laguerre Voronoi diagram.


Introduction
Suppose that we are given a set of n points V = {v 1 , v 2 , . . . , v n } in two-dimensional and three-dimensional space. One of the fundamental questions in the discrete and computational geometry is to consider the convexity of the given set, such as computing the convex hull of P. When V is finite, the convex hull of a set V is a polygon in the two-dimensional case and a polyhedron in the three-dimensional case. The problem of an algorithmic construction of a convex hull was initially addressed by Preperata [1].
The convex hull is a primitive object in computational geometry. For example, the construction of an ordinary spherical Voronoi diagram and spherical Laguerre Voronoi diagram, as defined in [2], uses the central projection of a 3D convex hull onto the sphere to generate Delaunay diagrams as presented in [3]. In the application viewpoint, Voronoi diagrams are widely used to model many natural phenomena displayed as tessellations. In the case of spherical tessellations, the spherical Laguerre Voronoi diagrams were used to model natural tessellations containing the weights of generators. For example, the research in [4] focused on the tessellation fitting of fruit skin patterns, and Chaidee et al. [5] proposed the dynamical model to generate spherical tessellations using the spherical Laguerre Voronoi diagrams.
In the case of the ordinary spherical Voronoi diagram, the points for computing a 3D convex hull are on the sphere. Therefore, the central projection of the 3D convex hull consists of a Delaunay triangulation of the diagram. However, the spherical Laguerre Delaunay diagram construction is different to the ordinary spherical Voronoi diagram in such a way that each generator contains its weight, and the points for generating the convex hull can be shifted over the sphere. Therefore, the convex hull of those points may include some points inside the constructed convex hull. As the diagram can be constructed from the central projection of the convex hull onto the sphere, the Laguerre cell corresponding to the hidden point is empty, which is a dilemma of the spherical Laguerre Voronoi The mentioned problem can be considered as the convex configuration of points in the space. We first review the similar and related problems to our study.

Related Works
To consider the literature, we primarily focused on the problems of convexification and convex configuration in the two-dimensional case.
Suppose that there is a closed chain composed of the vertices and links. The reconfiguration problem considers whether the given configuration can be transformed into another configuration. Lenhart and Whitsides [6] considered the problem when the lengths of links were fixed, and the reconfiguration was allowed across other links. This result also proved that every polygon could be convexified in the standard triangular form, i.e., the edge lengths of resulting convex polygon were preserved.
The more specified problem to the reconfiguration problem is the polygon convexification problem, a problem to transform a configuration of the simple polygon in the initial stage to a convex polygon. Everett et al. [7] considered the polygon convexification problem in the case of star-shaped polygons and proved that every star-shaped polygon in the general position could be convexified. In this problem, it was not necessary to fix the lengths of the links.
One of the famous problems, called the carpenter's rule problem, is to ask whether we can continuously move a simple polygon in such a way that all the vertices are in the convex position. Aichholzer et al. [8] and Connelly et al. [9] studied the problem of convexifying the polygonal cycle by employing a continuous motion as a convex closed curve such that no links cross each other during the motion. Especially, the study in [8] defined the term convex configuration as the configuration of a convex polygon where the edge links are fixed. Some results were compiled by Toussaint in [10].
In three-dimensional space, based on our observations, the configuration problem of points in 3D as a convex set has not been clearly identified yet. However, in the general dimension, the convex hull frame problem, known as the redundancy removal problem, is a problem to compute the vertex description of the given set of points. That is, to justify whether a point is in a convex hull of the given set. If it is inside the convex hull, we remove that point.
Clarkson [11] and Ottmann et al. [12] considered the algorithms for testing whether a given point is inside the convex hull. Dula and Helgason [13] studied the problem by identifying the extreme points (or vertices) of the convex hull of the given points using the linear programming viewpoint. Other similar problems included the vertex enumeration of the convex hull, as presented in [14].
With the basic problem of the convex hull frame problem, the closest issues to the Voronoi diagram in Laguerre geometry were first addressed by Aurenhammer [15] and Imai et al. [16]. In [16], the emptiness of the Laguerre Voronoi cell in Euclidean space R d was identified so that the Voronoi polygon of the generating circle c k was empty if the center of circle c k was not on the boundary of the convex hull.
In the spherical case, they assumed that all points were on or close to a sphere. Carili et al. in [17] established the sufficient condition under which no point was hidden in other planes of the convex hull with respect to other points.

Problem Statement and Our Contribution
In this study, we investigated the modification of the previous convex configuration problem. Suppose that a set of constrained vertex norms is given with a fixed point. We would find the existence of a convex polyhedron whose vertices correspond to the given set of constrained vertex norms.
In the two dimensional case, the convex configuration of points is a polygon where the edge lengths of a polygon are allowed to be moved, and fixed for the constrained vertex norms, whereas the problems in [6,7,9] used fixed link lengths.
The problem in the two-dimensional case was generalized to the three-dimensional case, i.e., we find a convex polyhedron satisfying the given set of constrained vertex norms. The main motivation of this study was initiated from the non-empty property of the spherical Laguerre Voronoi diagram, where the problem can be simplified to the problem of the modified convex configuration problem in three-dimensional space. The existence of the convex configuration can guarantee that for any set of weights, and we can always find a spherical Laguerre Voronoi diagram whose Voronoi cells are nonempty, which is a different approach to the problems stated in [11][12][13][14].
This paper is organized as follows. In Section 2, the notation, definitions, and the formulation of the problems are provided. We discuss the existence of a convex polygon, which is a convex configuration in the two-dimensional case, in Section 3. In Section 4, the existence of the convex configuration in the three-dimensional is proved. The application of the problem to the spherical Laguerre Voronoi diagram, which answers the question from the motivation of the study, is described in Section 5. The concluding remarks and future studies are clarified in the last section.

Preliminaries
In this section, we define the notations and the necessary definitions. After that, we formulate the problem.

Notations and Definitions
First, we focus on the definitions in the two-dimensional case. The definitions in the three-dimensional case will be provided in the latter part. Let V = {v 1 , . . . , v n } be a set of vertices that are arranged counterclockwise on a plane with respect to a fixed point O by the lexicographical order, i.e., a vertex with a smaller angle is earlier than a vertex with a larger angle. If the two vertices have the same angle, a vertex with a shorter distance from O is earlier than a vertex with a longer distance from O.
An edge e i = (v i , v i+1 ) is a segment joining the vertices v i and v i+1 with the length l i : ) denotes the Euclidean distance between v i and v i+1 . In this context, the norm v i of a vertex v i is the Euclidean distance d(v i , O) between v i and O. A chain is a straight line graph formed by the set of edges E = {e 1 , . . . , e n−1 }. A polygon P is a closed region bounded by a closed chain generated from the set of edges {e 1 , . . . , e n }, where e i = (v i , v i+1 ) for all 1 ≤ i < n − 1, except e n = (v n , v 1 ). A polygon P is said to be simple if the chain does not intersect itself, except for the vertices of P.
Let e i = (v i , v i+1 ) and e i+1 = (v i+1 , v i+2 ) be adjacent edges of a polygon P, whose common vertex is v i+1 . The angle between e i and e i+1 is denoted by ∠v i v i+1 v i+2 and is measured clockwise from the segment v i v i+1 . A simple polygon P is said to be convex if, and only if, for any point p, q in the polygon P, a segment joining p and q is in P.
For the special case, a simple polygon P is said to be a strictly convex polygon if, and only if, ∠v i v i+1 v i+2 < π for all i.
For a given edge length set L = {l 1 , . . . , l n }, a convex configuration of edge lengths is a convex polygon whose length of edges satisfies the set L with a counterclockwise order. The radius r i of a polygon vertex v i is defined as the Euclidean distance between the vertex v i and a given fixed point. Without a loss of generality, we assume that the origin O is such a fixed point. In this study, the radius r i will be regarded as the constrained vertex norms v i of the point v i . For a given straight line , an arbitrary half-plane with respect to the line is denoted by H( ). The half-plane containing the origin is written as H 0 ( ).
Next, we generalize the mentioned definitions in three-dimensional space. We assume that V = {v 1 , . . . , v n } is a set of points in the three-dimensional space. In our context, the convex polyhedron is a convex hull of a set V. We can also construct a polyhedron from the intersection of a finite number of half-spaces. In this study, we focus on the polyhedron that is formed from the bounded intersection of half-spaces.
Similar to the two-dimensional case, without a loss of generality, the radius r i of a polyhedron vertex v i is defined by the Euclidean distance between v i and the origin O.
In spherical geometry, we consider a unit sphere S 2 where the center is located at the origin. We also define S(O, r) as a sphere where the center is at O with radius r. For p, q ∈ S 2 , letd(p, q) be the geodesic distance between p and q defined bỹ For a fixed point q on the surface of S 2 , the spherical circle is defined as which is the circle where the center is at the point q with radius r i and 0 ≤ r i < π/2.

Problem Formulations
We assume that the set of constrained vertex norms R = {r 1 , r 2 , . . . , r n } is given. We place a point v i on the plane so that the distance between O and v i is the radius r i . Therefore, a simple polygon P is formed from the counterclockwise sequence of vertices {v 1 , . . . , v n } generated by the sequence of constrained vertex norms R.
In this study, we are interested in the following question. For a given set of constrained vertex norms R = {r 1 , r 2 , . . . , r n }, does there exist a convex configuration of the vertices set V = {v 1 , . . . , v n } including O with respect to the set of constrained vertex norms R? To avoid confusion with the problems in [6,8], the convex configuration in this context means that the radius r i is fixed for all i, and the length of edge l i := d(v i , v i+1 ) is allowed to be adjusted with respect to the position of v i and r i .
In the three-dimensional case, the concept of convex configuration in our context can be considered similar to the two-dimensional case. We assume that a vertex v i is in R 3 with the Euclidean distance between O and v i , for instance, r i . The convex configuration of the three-dimensional case is defined by the existence of a convex polyhedron whose points in the set V are vertices of the convex polyhedron. Therefore, the problem in three-dimensional space is to consider the existence of a convex configuration of v 1 , . . . , v n with respect to the given set of constrained vertex norms R.

The Existence of a Convex Polygon in the Plane
For a set V = {v 1 , v 2 , . . . , v n } of n > 3 vertices in the plane, we investigated the convexity of the constructed polygon.
First, we proved the simple case when the constrained vertex norms were distinct. For a given sequence of distinct constrained vertex norms R, the convex configuration can always exist by the following lemma. Lemma 1. Let R = {r 1 , . . . , r n } be a given set of constrained vertex norms, such that r i > 0 and r i = r j for all i, j. We assume that V = {v 1 , . . . , v n } is a set of vertices induced by R. There exists a convex configuration of V with respect to the set of constrained vertex norms R.
Proof. Without a loss of generality, we order the set R as the descending order, i.e., r 1 > r 2 > · · · > r n . Therefore, the set {r 1 , r 2 , . . . , r n } is a strictly decreasing sequence. We construct a sequence of concentric As r i are distinct positive numbers, there exists a line passing through all concentric circles C 1 , C 2 , . . . , C n−1 , but which does not pass through the circle C n . Let ⊥ be a perpendicular line of at O. The circle C n is laid in a half-plane of H( ). With the line ⊥ , we choose an arbitrary half-plane H( ⊥ ). The vertices v 1 , v 2 , .., v n−1 are chosen by the the intersection of the circle C i for all i = 1, . . . , n − 1, and the line , which are laid inside the half-plane H( ⊥ ).
Let M be a midpoint of the segment v 1 and v n−1 . We draw a line MO. Then, the last vertex v n is chosen at the intersection of MO and the circle C n , which is in the other half-plane H( ⊥ ), as shown in Figure 2. Hence, O is in the triangle v 1 v n−1 v n , which implies that O is laid inside the polygon constructed in the process of the vertices {v 1 , v 2 , . . . , v n }. This concludes the proof of the existence of the convex configuration. In Lemma 1, the vertices v 1 , . . . , v n are allowed to be collinear. In the case of a strictly convex configuration, we can perturb the vertices to be non-collinear. Thereby, the following theorem is obtained. Theorem 1. For a given set of distinct positive constrained vertex norms R = {r 1 , . . . , r n } and with an induced vertices set V = {v 1 , . . . , v n }, there exists a strictly convex configuration of V with respect to the constrained vertex norms set R.
Proof. We assume that the vertices of a convex configuration are located by the processes in Theorem 1, as shown in Figure 2. The perturbation is done with the vertices v 3 , . . . , v n−1 by the following processes.
We first consider the angular distance between vertices v 1 and v n−1 . For the triangle v 1 v n−1 v n , the angle γ between − − → v n v 1 and − −−− → v n v n−1 is γ := arccos Hence, the resulting polygon is perturbed to be a strictly convex configuration, which concludes the proof of the existence.
Before we prove the following lemma, we define the segment from the intersection between a line and all concentric circles. Let be a line, and C 1 be a circle with radius r 1 , which is the largest circle among the concentric circles. is the segment induced from the intersection between and C 1 , whose initial and end points are on the circle C 1 .
We already proved the case m i = 1 for all i in Lemma 1. Similarly to Theorem 1, the proof relies on the location of points on concentric circles with constrained vertex norms r (1,1) , r (2,1) , . . . , r (k,1) . Hence, without a loss of generality, we assume that the center of the circles are at the origin O of the XY-plane.
To prove the convex configuration containing O with this assumption, the strategy of the proof is to distribute the points to all quadrants as much as possible. Therefore, it is necessary to separate into two cases when max{m 1 , . . . , m k } = 4 and max{m 1 , . . . , m k } = 2 or 3, as follows.
Case 1 max{m 1 , . . . , m k } = 4 We construct lines 1 and 2 to intersect all concentric circles such that 1 and 2 are on the opposite half-plane with respect to the Y-axis as shown in Figure 3 (left). Then, we lay the points in the set V satisfying each circle radius on the intersection between 1 , 2 , and the concentric circles. This forms a convex quadrilateral containing the origin, which is a convex configuration of V with respect to the given constrained vertex norms.
We first draw a line 1 , such that 1 is on the side of a half-plane with respect to Y-axis. The first k points v (1,1) , v (2,1) , . . . , v (k,1) are chosen from the intersection between 1 and concentric circles in the same quadrant. After that, we find the midpoint M between v (1,1) and v (k,1) on the line 1 and draw a line MO. The intersection between MO and the circle C p with the radius r (p,1) is denoted as M 1 . Then, we draw a line 2 passing through M 1 , where 2 is laid in the opposite half-plane of 1 with respect to the Y-axis, and 2 intersects all concentric circles, which is shown in Figure 3 (right). Hence, we place the remaining points on the intersections between 2 and the concentric circles. As M 1 is the point on the largest circle that contains the maximum number of points, v (1,1) v (k,1) M 1 forms a triangle, or a convex quadrilateral v (1,1) v (k,1) M 1 v (q 1 ,q 2 ) for some q 1 , q 2 , where v (q 1 ,q 2 ) is the point of the intersection between the circlec q 1 and the line 2 . This forms a convex configuration of V with respect to the given constrained vertex norms R containing O.
With these cases, the proof is concluded as desired.
Proof. Suppose that the convex configuration is settled by Lemma 2. A proof relies on each case, as presented in Lemma 2.
Case 1 max{m 1 , . . . , m k } = 4 In this case, the construction in Lemma 2 yields a convex quadrilateral. Without a loss of generality, we assume that all points are separated into four quadrants, and we start from the points in the second quadrant.
We first move the v (k,1) to the position that is close to the negative side of the X-axis, i.e., the angle between −−−→ Ov (k,1) and the negative side of the X-axis is θ 1 . Then we draw the line k,1 passing through v (k,1) and perpendicular to the X-axis. Suppose that H 0 ( k,1 ) is the half-plane including the origin. We perturb all vertices v (2,1) , v (3,1) , . . . , v (k−1,1) by a technique similar to Theorem 1 in such a way that all the vertices are in the region H 0 ( k,1 )\ (k,1) . Therefore, there exists a line 1 passing through v (k−1,1) and v (k,1) , which is different to k,1 .
Let  Using a similar technique, we can perturb all vertices in the first quadrant and the fourth quadrant. Finally, the convex polygon can be closed by the point with the largest radius in the third quadrant and fourth quadrant, and the point with the largest radius in the first quadrant and the second quadrant. That is, there is a strictly convex configuration from the given set of constrained vertex norms.
Case 2 max{m 1 , . . . , m k } = 2 or 3 We can employ the same strategy of the first case to the points in the second, fourth, and the first quadrant to obtain the strictly convex configuration of the given set of constrained vertex norms.
Therefore, we can find the strictly convex configuration from the given set of constrained vertex norms in any case.

Existence of a Convex Polyhedron in Three-Dimensional Space
Given a set of constrained vertex norms R = {r 1 , . . . , r n }, we assume that the constrained vertex norms are the Euclidean distance from the origin to the vertex v 1 , . . . , v n in three-dimensional space. The convex configuration, in this case, is the convex polyhedron containing the origin O.
In the three-dimensional case, the existence of the convex configuration can be proved. First, we consider the simple case where all of the constrained vertex norms are distinct. Proof. When n = 4, we place the points v 1 , v 2 , v 3 , v 4 with respect to r 1 , r 2 , r 3 , r 4 as the vertices of the tetrahedron. Therefore, the convex configuration is obviously obtained.
Suppose that n ≥ 5. We assume that the descending order of R = {r 1 , . . . , r n } is R = {r 1 , . . . , r n }, where r i = r j for some i, j. We construct concentric spheres S 1 (O, r 1 ), S 2 (O, r 2 ) at the origin O with radius r 1 and r 2 . Without a loss of generality, we place the vertex v 1 and v 2 on the north pole of sphere S 1 and the south pole of sphere S 2 , respectively.
We consider the XY-plane and place the vertices v 3 , . . . , v n onto the XY-plane by the processes in Theorem 1 and Lemma 1 to obtain a convex polygon P of {v 3 , . . . , v n }. Then, we join the edge v 1 from the north pole to the vertex set {v 3 , . . . , v n }, and v 2 from the south pole to the same set. The obtained polyhedron is a polyhedron whose faces are triangles. As the polygon P is convex and contains the origin O, the constructed polyhedron is convex as desired.
Proof. We first construct k concentric spheres S 1 , S 2 , . . . , S k where the center is at O with constrained vertex norms r (1,1) , r (2,1) , . . . , r (k,1) . Let S 0 be a sphere where the radius is r (1,1) + for any > 0. Therefore, there exists a circular cone C whose apex A is at the north pole of the sphere S 0 , and the lateral area of the cone intersects all the concentric spheres, i.e., the apex angle θ satisfies θ < 2 arctan r (1,1) + r (k,1) .
Hence, the cone C intersects the concentric spheres S 1 , S 2 , . . . , S k such that the intersection between C and a sphere S j for all j = 1, 2, . . . , k − 1 is a spherical circle,c j , where the centers are the north pole of each sphere. The distance from O to a point on the circlec j is r (j,1) . Therefore, there are k circles from the largest sphere S 1 to the smallest sphere S k on the upper hemisphere, as shown in the cross section in Figure 5. We choose a line emanating from the apex A on the surface of C. For each layer of circlec j over the upper hemisphere except the smallest layerc k , we place a point on the line . Therefore, each layer has at least one point on its layer.
For the number of points of k layers m 1 , m 2 , . . . , m k , we assume that the p-th layer contains the maximum number of points, i.e., m p := max{m 1 , m 2 , . . . , m k }. Therefore, we first distribute m p points on the spherical circlec p at the p-th layer in such a way that the angular distances β between each vertex on the spherical circlec p are equal. We fix the point that is already placed on the line and distribute the other m p − 1 points, says v p,1 , v p,2 , . . . , v p,m p .
For each v p,i on the p-level, we construct a plane P v p,i passing through v p,i and the Z-axis to create a spherical grid. P v p,i intersects all concentric spheres and generates longitude lines L v p,i ,c p on each sphere S i , which are great circles.
Therefore, in each level j = 1, . . . , p − 1, p + 1, . . . , k, the latitude is considered the spherical circlẽ c j , which intersects the longitude L v p,j ,c p to m p points. We can place m j points on those intersections arbitrarily since m j ≤ m p . As all vertices are laid on the convex surface, for each placed point on the intersections, there exists a plane tangent to the cone passing through that point, and all points are on the same side of the plane. Hence, there exist faces joining v p 1 ,i 1 , v p 2 ,i 2 , v p 3 ,i 3 for some p 1 , i 1 , p 2 , i 2 , p 3 , i 3 , which form the faces of convex polyhedra.
With the exceptional case for the last smallest layer, for instance, the k-th level, we construct a plane z = −r (k,1) + γ. Therefore, the parameter γ can be considered in the following case.
If the k-th layer contains exactly one point, we choose γ = 0. This means that the plane z = −r m 1 +···+m k−1 +1 is a tangent plane at (0, 0, −r (k,1) ). Therefore, the polyhedron can be bounded by joining all of the vertices to that point.
Otherwise, we assume that there are m k points at the k-th layer. We choose a small γ > 0, such that γ < |r (k,1) |. Therefore, there exists a spherical circle in the k-th layer. Then, we distribute m k points, with the same angles and connecting the points in the k-th level to the above levels to construct a convex polyhedron.
Therefore, the convex configuration exists by the construction process, which concludes the proof.

Applications
The main application of the existence of the convex configuration in the three-dimensional case is the confirmation regarding the non-emptiness properties of the spherical Laguerre Voronoi diagram, in which the details will be described soon.
We first recall the definitions and constructions of the spherical Laguerre Voronoi diagram, as presented in [2].
On the unit sphere S 2 , let P = {p 1 , . . . , p n } be a set of points with the set of positive real numbers W = {w 1 , . . . , w n } and G = {c 1 , . . . ,c n } be a set of spherical circles whose center is each a point in P corresponding to each w i ∈ W. The set W is regarded as the weight set, meaning that each center p i of the circlec i has its weight w i . The spherical Laguerre Voronoi diagram L = {L 1 , . . . , L n } is a Voronoi diagram generated from the set of spherical circles G with the Laguerre proximitỹ The algorithms for constructing the spherical Laguerre Voronoi diagram presented in [2] were based on the intersection of half-spaces of planes passing through the spherical circles containing the origin. The dual structure of the spherical Laguerre Voronoi diagram is the spherical Laguerre Delaunay diagram. Figure 6 shows the ordinary Voronoi diagram and spherical Laguerre Voronoi diagram with the same generators. The spherical Laguerre Delaunay diagram can be constructed by the following procedures. For a set of generating circles G, we suppose that P i is a plane passing through the spherical circlec i . Therefore, the dual point of the plane P i can be considered as P * i = 1 cos w i p i , and the spherical Laguerre Delaunay diagram can be constructed from the central projection of the convex hull G * = {P * 1 , . . . , P * n } onto the unit sphere S 2 .
For a spherical Laguerre Voronoi diagram L generated by G, the spherical Laguerre Voronoi cell L i is said to be empty if L i = ∅. The spherical Laguerre Voronoi diagram L satisfies the non-emptiness property if for all i, L i = ∅. A cell L i of the spherical Laguerre Voronoi diagram is empty if the dual point P * i of the circlec i is inside of the convex hull of the set G * . Instead of giving the spherical circles, we assume that the radii of the spherical circles are given. The interesting question is to consider whether or not we can find the location of the generators on the sphere in such a way that the generated spherical Laguerre Voronoi diagram satisfies the non-emptiness property.
The answer to the mentioned question is positive as follows. Proof. For the set of spherical circle radii W = {w 1 , . . . , w n }, each radius corresponds to the radius r i = 1/ cos(w i ). r i ≥ 1, by the assumption of the spherical circle radius. Thereby, we generated a set of constrained vertex norms R = {r 1 , . . . , r n }. By Theorem 3, there exists a convex configuration of a set P = {p 1 , . . . , p n } with respect to R. Therefore, all dual points in G * are on the corner of the convex hull of G * . That is, the spherical Laguerre Delaunay diagram with respect to G * consists of all generators P = {p 1 , . . . , p n }.
Hence, this implies that there exists a spherical Laguerre Voronoi diagram satisfying the non-emptiness property with respect to a given set of radii as desired.

Concluding Remarks
We consider the convex configuration problem of n points when the constrained vertex norms, which are measured from a fixed point, are given. In the two-dimensional case, we proved that the strictly convex configuration always exists when all constrained vertex norms are distinct or each radius is repeated for, at most, four points. However, the problem is still open when repeated constrained vertex norms are greater than or equal to five points. Therefore, we leave a conjecture to prove this interesting property.
Conjecture: For any set of given constrained vertex norms R, it is not always possible to find the convex configuration with respect to the given set R.
However, the existence of a convex configuration is guaranteed in the case of three-dimensional space. Using this fact, we can apply the existence of a convex configuration to the existence of the spherical Laguerre Voronoi diagram satisfying the non-emptiness property.
Author Contributions: Conceptualization, S.C.; investigation, S.C. and K.S.; writing-original draft preparation, S.C.; writing-review and editing, S.C. and K.S.; supervision, K.S.; funding acquisition, S.C. All authors have read and agreed to the published version of the manuscript.