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

^{1}

^{2}

^{*}

## Abstract

**:**

## 1. Introduction

#### 1.1. Related Works

#### 1.2. Problem Statement and Our Contribution

## 2. Preliminaries

#### 2.1. Notations and Definitions

#### 2.2. Problem Formulations

## 3. The Existence of a Convex Polygon in the Plane

**Lemma**

**1.**

**Proof.**

**Theorem**

**1.**

**Proof.**

**Lemma**

**2.**

**Proof.**

**Case 1**$\mathrm{max}\{{m}_{1},\dots ,{m}_{k}\}=4$

**Case 2**$\mathrm{max}\{{m}_{1},\dots ,{m}_{k}\}=2$ or 3

**Theorem**

**2.**

**Proof.**

**Case 1**$\mathrm{max}\{{m}_{1},\dots ,{m}_{k}\}=4$

**Case 2**$\mathrm{max}\{{m}_{1},\dots ,{m}_{k}\}=2$ or 3

## 4. Existence of a Convex Polyhedron in Three-Dimensional Space

**Lemma**

**3.**

**Proof.**

**Theorem**

**3.**

**Proof.**

## 5. Applications

**Theorem**

**4.**

**Proof.**

## 6. Concluding Remarks

**Conjecture:**For any set of given constrained vertex norms$\mathcal{R}$, it is not always possible to find the convex configuration with respect to the given set$\mathcal{R}$.

## Author Contributions

## Funding

## Acknowledgments

## Conflicts of Interest

## References

- Preparata, F.P.; Hong, S.J. Convex hulls of finite sets of points in two and three dimensions. Commun. ACM
**1977**, 20, 87–93. [Google Scholar] [CrossRef] - Sugihara, K. Laguerre Voronoi diagram on the sphere. J. Geom. Graph.
**2002**, 6, 69–81. [Google Scholar] - Sugihara, K. Three-dimensional convex hull as a fruitful source of diagrams. Theor. Comput. Sci.
**2000**, 235, 325–337. [Google Scholar] [CrossRef] [Green Version] - Chaidee, S.; Sugihara, K. Spherical Laguerre Voronoi diagram approximation to tessellations without generators. Graph. Model.
**2018**, 95, 1–13. [Google Scholar] [CrossRef] - Chaidee, S.; Sugihara, K. Laguerre Voronoi Diagram as a Model for Generating the Tessellation Patterns on the Sphere. Graphs Comb.
**2020**, 36, 371–385. [Google Scholar] [CrossRef] - Lenhart, W.J.; Whitesides, S.H. Reconfiguring closed polygonal chains in Euclidean d-space. Discrete Comput. Geom.
**1995**, 13, 123–140. [Google Scholar] [CrossRef] - Everett, H.; Lazard, S.; Robbins, S.; Schröder, H.; Whitesides, S. Convexifying star-shaped polygons. In Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG’98), Montréal, QC, Canada, 10–12 August 1998; pp. 10–12. [Google Scholar]
- Aichholzer, O.; Demaine, E.D.; Erickson, J.; Hurtado, F.; Overmars, M.; Soss, M.; Toussaint, G.T. Reconfiguring convex polygons. Comput. Geom.
**2001**, 20, 85–95. [Google Scholar] [CrossRef] [Green Version] - Connelly, R.; Demaine, E.D.; Rote, G. Blowing up polygonal linkages. Discrete Comput. Geom.
**2003**, 30, 205–239. [Google Scholar] [CrossRef] - Toussaint, G. The Erdős–Nagy theorem and its ramifications. Comp. Geom.-Theor. Appl.
**2005**, 31, 219–236. [Google Scholar] [CrossRef] [Green Version] - Clarkson, K.L. More output-sensitive geometric algorithms. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 20–22 November 1994; pp. 695–702. [Google Scholar]
- Ottmann, T.A.; Schuierer, S.; Soundaralakshmi, S. Enumerating extreme points in higher dimensions. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, 2–4 March 1995; Springer: Berlin, Germany, 1995; Volume 900, pp. 562–570. [Google Scholar]
- Dulá, J.H.; Helgason, R.V. A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space. Eur. J. Oper.
**1996**, 92, 352–367. [Google Scholar] [CrossRef] - Kalantari, B. A characterization theorem and an algorithm for a convex hull problem. Ann. Oper. Res.
**2015**, 226, 301–349. [Google Scholar] [CrossRef] - Aurenhammer, F. Power diagrams: Properties, algorithms, and applications. SIAM J. Comput.
**1987**, 16, 78–96. [Google Scholar] [CrossRef] - Imai, H.; Iri, M.; Murota, K. Voronoi diagram in the Laguerre geometry and its applications. SIAM J. Comput.
**1985**, 14, 93–105. [Google Scholar] [CrossRef] - Caroli, M.; de Castro, P.M.; Loriot, S.; Rouiller, O.; Teillaud, M.; Wormser, C. Robust and efficient Delaunay triangulations of points on or close to a sphere. In Proceedings of the International Symposium on Experimental Algorithms, Naples, Italy, 20–22 May 2010; pp. 462–473. [Google Scholar]

**Figure 1.**(

**Left**) The general configuration of points on the concentric circles that forms a non-convex polygon; (

**right**) the convex configuration of points with respect to the constrained vertex norms.

**Figure 2.**The construction of a convex polygon with respect to the given distinct constrained vertex norms.

**Figure 3.**The construction for the convex configuration of V when (

**left**) $\mathrm{max}\{{m}_{1},\dots ,{m}_{k}\}=4$ and (

**right**) $\mathrm{max}\{{m}_{1},\dots ,{m}_{k}\}=2$ or 3.

**Figure 4.**The perturbation of the points to find the strictly convex configuration when $\mathrm{max}\{{m}_{1},\dots ,{m}_{k}\}=4$.

**Figure 5.**The cross section at the $YZ$-plane for the concentric spheres including a spherical circle of each layer and the cone $\mathcal{C}$.

**Figure 6.**The Voronoi diagrams of 50 generators; (

**left**) the ordinary spherical Voronoi diagram; (

**right**) the spherical Laguerre Voronoi diagram with random weights. Certain cells lose in the case of the spherical Laguerre Voronoi diagram.

© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

## Share and Cite

**MDPI and ACS Style**

Chaidee, S.; Sugihara, K.
The Existence of a Convex Polyhedron with Respect to the Constrained Vertex Norms. *Mathematics* **2020**, *8*, 645.
https://doi.org/10.3390/math8040645

**AMA Style**

Chaidee S, Sugihara K.
The Existence of a Convex Polyhedron with Respect to the Constrained Vertex Norms. *Mathematics*. 2020; 8(4):645.
https://doi.org/10.3390/math8040645

**Chicago/Turabian Style**

Chaidee, Supanut, and Kokichi Sugihara.
2020. "The Existence of a Convex Polyhedron with Respect to the Constrained Vertex Norms" *Mathematics* 8, no. 4: 645.
https://doi.org/10.3390/math8040645