اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConical Existence of Closed Curves on Convex Polyhedra
193
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that live on a cone, in the sense that C and a neighborhood to one side may be isometrically embedded on the surface of a cone Lambda, with the apex a of Lambda enclosed inside (the image of) C; we also prove that each point of C is visible to a. In particular, we obtain that these curves have non-self-intersecting developments in the plane. Moreover, the curves we identify that live on cones to both sides support a new type of source unfolding of the entire surface of P to one non-overlapping piece, as reported in a companion paper.
قيم البحث
اقرأ أيضاً
We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q lives on a cone to both sides; it includes simple, closed quas
igeodesics. Cutting a particular subset of the cut locus of Q (in P) leads to a non-overlapping unfolding of the polyhedron. This gives a new general method to unfold the surface of any convex polyhedron to a simple, planar polygon.
Given a convex polyhedral surface P, we define a tailoring as excising from P a simple polygonal domain that contains one vertex v, and whose boundary can be sutured closed to a new convex polyhedron via Alexandrovs Gluing Theorem. In particular, a d
igon-tailoring cuts off from P a digon containing v, a subset of P bounded by two equal-length geodesic segments that share endpoints, and can then zip closed. In the first part of this monograph, we primarily study properties of the tailoring operation on convex polyhedra. We show that P can be reshaped to any polyhedral convex surface Q a subset of conv(P) by a sequence of tailorings. This investigation uncovered previously unexplored topics, including a notion of unfolding of Q onto P--cutting up Q into pieces pasted non-overlapping onto P. In the second part of this monograph, we study vertex-merging processes on convex polyhedra (each vertex-merge being in a sense the reverse of a digon-tailoring), creating embeddings of P into enlarged surfaces. We aim to produce non-overlapping polyhedral and planar unfoldings, which led us to develop an apparently new theory of convex sets, and of minimal length enclosing polygons, on convex polyhedra. All our theorem proofs are constructive, implying polynomial-time algorithms.
Given any two convex polyhedra P and Q, we prove as one of our main results that the surface of P can be reshaped to a homothet of Q by a finite sequence of tailoring steps. Each tailoring excises a digon surrounding a single vertex and sutures the d
igon closed. One phrasing of this result is that, if Q can be sculpted from P by a series of slices with planes, then Q can be tailored from P. And there is a sense in which tailoring is finer than sculpting in that P may be tailored to polyhedra that are not achievable by sculpting P. It is an easy corollary that, if S is the surface of any convex body, then any convex polyhedron P may be tailored to approximate a homothet of S as closely as desired. So P can be whittled to e.g., a sphere S. Another main result achieves the same reshaping, but by excising more complicated shapes we call crests, still each enclosing one vertex. Reversing either digon-tailoring or crest-tailoring leads to proofs that any Q inside P can be enlarged to P by cutting Q and inserting and sealing surface patches. One surprising corollary of these results is that, for Q a subset of P, we can cut-up Q into pieces and paste them non-overlapping onto an isometric subset of P. This can be viewed as a form of unfolding Q onto P. All our proofs are constructive, and lead to polynomial-time algorithms.
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in $RR^n$.
We prove that every positively-weighted tree T can be realized as the cut locus C(x) of a point x on a convex polyhedron P, with T weights matching C(x) lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are in fact a continuu
m of polyhedra P each realizing T for some x on P. Three main tools in the proof are properties of the star unfolding of P, Alexandrovs gluing theorem, and a cut-locus partition lemma. The construction of P from T is surprisingly simple.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
