ترغب بنشر مسار تعليمي؟ اضغط هنا

Source Unfoldings of Convex Polyhedra via Certain Closed Curves

154   0   0.0 ( 0 )
 نشر من قبل Joseph O'Rourke
 تاريخ النشر 2012
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

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 quasigeodesics. 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.



قيم البحث

اقرأ أيضاً

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 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.
177 - Joseph ORourke 2020
The construction of an unbounded polyhedron from a jagged convex cap is described, and several of its properties discussed, including its relation to Alexandrovs limit angle.
We solve an open problem posed by Michael Biro at CCCG 2013 that was inspired by his and others work on beacon-based routing. Consider a human and a puppy on a simple closed curve in the plane. The human can walk along the curve at bounded speed and change direction as desired. The puppy runs with unbounded speed along the curve as long as the Euclidean straight-line distance to the human is decreasing, so that it is always at a point on the curve where the distance is locally minimal. Assuming that the curve is smooth (with some mild genericity constraints) or a simple polygon, we prove that the human can always catch the puppy in finite time.
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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا