Scribd
Upload
27 views

Geometry Assignment Help

For any help with math homework, users can call +1 678 648 4277, email [email protected], or visit https://www.mathhomeworksolver.com/. The summary will focus on problem 3 from the document. Problem 3 asks which graphs can be cut with all-layer simple folds and one straight cut. Graphs (a) and (d) cannot be constructed this way, while graphs (b) and (c) can, as explained by the drawings of the folding sequences.

Uploaded by

Math Homework Solver
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
27 views

Geometry Assignment Help

For any help with math homework, users can call +1 678 648 4277, email [email protected], or visit https://www.mathhomeworksolver.com/. The summary will focus on problem 3 from the document. Problem 3 asks which graphs can be cut with all-layer simple folds and one straight cut. Graphs (a) and (d) cannot be constructed this way, while graphs (b) and (c) can, as explained by the drawings of the folding sequences.

Uploaded by

Math Homework Solver
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 4

For any help related queries, call us at: – 

+1 678 648 4277


You can mail us at:- [email protected] or
reach us at:- https://www.mathhomeworksolver.com/
Geometry Assignment Help
We will drop (ignore) your lowest score on any one problem.

Problem 1. Prove that, for any polygon with n vertices, its straight
skeleton has O(n) vertices, edges, and faces (as mentioned in lecture).
You may assume any other properties of the straight skeleton mentioned
in lecture.
Solution: We will look at the graph created by the union of the polygon
and the straight skeleton by induction. Let us consider how many edges,
vertices, and faces it contains.
Faces: The method of construction by shrinking edges leads to a
correspondence between every edge in the original polygon and two faces
in the new graph. Since there are n edges in a polygon with n vertices,
the new graph will have 2n faces.
Vertices: A splitting event only occurs when there is a reflex angle in
the polygon. The number of events where an edge or face shrink to zero
are bounded by the number of edges in the region. An edge can only be
part of two regions. Thus the number of vertices is bounded by twice the
edges plus the number of reflex angles.
Edges: Since the resulting graph is planar, we can use Euler’s Formula,
V − E + F = 2, and the bounds for the number of faces and vertices to
bound the number of edges.
A more general proof about the linear complexity of straight skeletons
can be found in Aichholzer and Aurenhammer’s Straight Skeletons for
General Polygonal Figures in the Plane.
We highly recommend that you use a vector drawing program that can
compute accurate intersections, such as Inkscape (free), Cinderella
(mostly free), Adobe Illustrator (commercial), AutoCAD
(commercial), or Rhino3D (commercial).
Solution: There is no one correct answer.

Problem 3. Which of the following graphs can be cut by all-layers


simple folds and one complete straight cut? For each, draw a folding
sequence or argue why there is none.

(a) (b)

(c) (d)
Solution: Refer to the figure below.
(a)This cannot be constructed by all-layers simple folds. All the edge
lengths are different and thus there is no axis of symmetry.
(b)This can be constructed by all-layers simple folds. It is a regular
heptagon and thus can be folded in half. After that the angles can
be bisected.
(c)This can be constructed by all-layers simple folds. First, note the
hexagons are reflections over a horizontal and vertical line. In a
single polygon this is a problem, as two reflections may not be
decomposable into one, and any fold not along symmetry intersecting
the polygon will move lines over non-lined paper. Here we can fold
the edges down, so the hexagons lie along a strip. Now fold the strip
so the hexagons lie reflected across from each other, and then fold
again so they lie on top of each-other. It is easy to see a single
hexagon can be constructed by all-layers simple folds.
Another solution is provided in the diagram below. This involves
two folds to effectively rotate the hexagons relative to each other,
allowing them to be folded directly onto each other.
(d)This cannot be constructed by all-layers simple folds. The only
initial line of symmetry is down the middle. After the initial fold,
we have most of a triangle and may notice that the bisectors of the
two remaining angle intersect the opposite sides at angles other than
90◦ .
1

Nope.

Yep.
2
(a) (b)

1
Nope.
6

4 3

Yep.

(c) (d)

You might also like