9 views

Uploaded by Mnaom

- 2012 2H Revision
- Zentangle 3 - Tangling With Rubber Stamps
- Ch 6
- Problems -Chapter 29
- cu31924059156616
- Module 9 Circle Properties Worksheet and Revision Guide
- 9Maths Sample Papers 1
- Some Notes on Eucleadean Geometry
- Basic-Drafting2.docx
- Teach Yourself Geometry
- javier onate
- Circle
- lec25
- Craig Method
- the-ancient-secret-ii.pdf
- Eureka.in Standared_06 Content List
- 01-area-under-the-curve1.pdf
- 2008 Fermat Solution
- Course_Book_Sketchup_TIMZC_advancemodelling.pdf
- Dancing Solution

You are on page 1of 11

Prosenjit Bose Evangelos Kranakis Danny Krizanc Anil Maheshwari School of Computer Science Carleton University Ottawa, ON, K1S 5B6, Canada. E-mail: jit,kranakis,krizanc,maheshwa @scs.carleton.ca

Jurek Czyzowicz Dept. Informatique ` Univ. du Qu bec a Hull e Hull, Qu bec J8X 3X7, e Canada. E-mail: czyzowic@UQAH.UQuebec.CA

Abstract We study several problems related to cutting circles into equal area pieces. Our objective is to minimize the total length of the cuts.

1 Research

supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada).

1 Introduction We consider the problem of cutting a circular domain into equal area pieces so as to minimize the total sum of the lengths of the cuts. In general, one may consider different and slightly more general variants of the problem. For example, circular could be replaced with any planar domain such as square, circle, ellipse, etc, and cuts may be interpreted to be straight lines, polygonal lines, curvilinear, etc. In general a cut is a rectiable curve. We are interested in the sum of the lengths of these cuts. In this paper we are concerned mostly with straight line cuts of circles. It will be shown that even these simple variants of the problem are interesting and challenging. In Section 2 we determine the optimal straight line cuts for a unit circle. To the best of our knowledge these problems have not previously appeared in the literature. There are several closely related problems that have been studied. Overmars and Welzl [4] studied the problem of cutting a polygon drawn on a piece of paper in the cheapest possible way. Frederickson [3] discusses several interesting problems related to geometric dissection. Also Croft, Falconer and Guy [2] discuss several problems related to tiling and dissection of circles and squares. 2 Cutting Circles Without loss of generality we consider the unit circle. Problem 2.1 What is the minimum length of a cut that cuts a circle into two equal area pieces? Theorem 2.1 Any curve that cuts a unit circle into two equal area pieces has length . Moreover, diameter of is an optimal cut.

a

C a

S O

b

P ROOF (Proof by contradiction) Consider a curve that cuts the unit circle into two equal areas and has length . There are two cases depending upon whether is incident to the boundary of or not. Consider rst the case when is not incident to the boundary of . The curve encloses an area of (since ). The smallest perimeter gure that encloses a given area in the plane is a circle (see [1]). What is the perimeter of a circle which encloses an area of ? It turns out that the perimeter of this circle is equal to . Same contradiction arises if is incident to the boundary of at exactly one point. Consider the case when is incident to the boundary of at two points, say and (see Figure 1). Consider the chord . If passes through the center of , then , a contradiction. Assume that does not pass through the center. Let be the chord (a diameter) parallel to that passes through the center of . Since encloses half the area of , it must intersect . Consider points of that are in the half circle, say , dened by , and not containing the chord . Let be the point of in that is furthest from (if there are more than one furthest point, choose any). Let be the chord passing through and is parallel to . Consider the perpendicular bisector of and we know that it passes through the center of the

3

$ )#

$%# %# $

! ('& &

$ %#

$ %#

#

" !

$ %#

circle and let it intersect at . It is easy to show that , and any curve with endpoints at and and touching the chord at will have length , a contradiction. If is incident to the boundary of at more than two points, choose any two neighboring points, and call them and and apply the above contradiction. Problem 2.2 What is the minimum length of straight line cuts, that cut a circle into equal area pieces, and no two lines intersect in the interior of the circle? An optimal solution for this problem is presented in Figure 2 and furthermore, any optimal solution can be transformed to such a solution. In order to prove this, we need the following lemma. Lemma 2.1 (see Figure 3) Let be an inscribed triangle in a circle . Let , , and be the portion of the circle formed by the arc (respectively, , ) and the chord (respectively, , ) that excludes . Then Area min Area

P ROOF Without loss of generality assume that is the smallest side of and therefore the portion has minimum area among and . Form a inscribed isoceles triangle , such that .

4

$ # ! 1 0$ H@& R 0& 67#& I1F$H@& QP12#& I('& & E @ & E&@ & $ # & & @ B0@ 403$6# 0 ! 13$C0H@GFED&C017#& # VS TS$ $ )# TS)# $

9 TS%XW $#

$ %#

0$0 #

a C A

b B

Figure 3: Area

min Area

a C A C

c

m O O

b B B

Observe that Area Area , since the two triangles have the same base , but their height is different. We show that Area Area . There are two cases: Case I: does not contain the center of (see Figure 4a). Draw the tangent parallel to passing through . Let be the line passing through and is perpendicular to . Let and intersect at . Furthermore let be the point of intersection of and . Observe that forms a rectangle and Area Area Area .

5

$# $ Y ga0TS%c#fW Te6# $ d ! aT)X`WY d 0 TS$ 5Q# B0@ @ @ $ 0 TS$ @0 # @ 5 0TS%XW $# $# ! 0a TS%`WY $ %# a # bTS$%X`WY $ 0a ST)#X`WY xwFvur t

Figure 4: (a)

y q

a c

xwFvur t

t yxwFvusrq

Corollary 2.1 Let be an open simple convex polygonal curve inscribed in a circle , consisting of straight line segments and possibly arcs of . By removing from , can be partitioned into several components. Then the area of is strictly bigger than the minimum among the areas of the components. Corollary 2.2 Consider a subdivision of into equal area pieces formed by straight line segments such that no two lines intersect in the interior of . Every face of the subdivision is bounded by at most two segments. P ROOF Proof by contradiction. Suppose that there is a face whose boundary consists of more than two segments. The area of is and from Corollary 2.1 we know that the area of is strictly bigger than the minimum of the areas of the components that it cuts off . . A contradiction. The area of each of these components is at least Theorem 2.2 Figure 2 represents an optimal solution for cutting a circle into equal area pieces by straight line segments, where no two lines intersect in the interior of . Moreover any optimal solution for this problem can be transformed to the solution presented in the gure. P ROOF Consider an optimal solution. From Corollary 2.2 we know that each face in the subdivision consists of at most two segments on its boundary. Consider the dual graph of this subdivision, excluding

6

u u u $ T#nk j tm Q0TSnk j $ s $ 0%lk S# m 200TSnk j 0 TSn4kT#nk $ d $ T#nk j rE 0 TSnk j 200 TSnk j $ $ $ qm p0%T#$ j $ S S# m o200TSnk j m o700pnk $ S# $# W 200 TS%Xih m 700 TSnk j m 200 plk j 700S 0S $ %# 0TS)# $ o v w v v o w

Case II: contains the center of (see Figure 4b). Reect the triangle along . Let the reection of falls on to We show that by proving that and The angle since . Now we show that Observe that . Since the triangles and are isoceles, . Therefore .

$# 0 TS%XW

. . . ,

S u

O x cos x

sin x

the external face, this graph is a path. Fixing the segment corresponding to one end of the path, we can move other segments one by one so as to obtain the solution presented in Figure 2. Problem 2.3 What is the minimum length of the straight line cuts, that cut a circle into equal area pieces, where the lines intersect in at most one Steiner point in ? Before we present the solution we need the following geometric relation. Observation 2.1 Consider a unit circle with center O and a Steiner point S as in Figure 5. Consider the diameter passing through and let be a point on the boundary of and project onto the diameter. The part of the area of the circle enclosed by is given by Area Area Area and the length of segment SA is given by

Theorem 2.3 If a unit circle is cut into equal area pieces by straight lines in such a way that the lines intersect in at most one

7

& E Y & Q E & 1& a b"E iE & fz& t E I~yY a5 Eau pII~y5Y au }|{zyY uIx

Steiner point in then the sum of the lengths of the cut is always . Moreover, the optimal cut is realized when the Steiner point is the center of . P ROOF Consider rst the case when is even. From Theorem 2.1 we know that any curve that cuts the circle into two equal area pieces has . Since is even we can pair up the curves so that each length pair splits into two equal area pieces and hence has a length . It follows that if is even then the sum of the length of the cuts is . It is easy to see that an optimal cut is realized when Steiner point is the center of and each cut is a straight line. Consider the case when is odd and suppose we cut the circle into equal area pieces as shown in Figure 6. Observe that if Area then Area . The total length of the cuts, say , is given by the following equation:

a |u zyY

E E

is odd. (

x

is not a cut)

9

since , it is enough to show that if

From the above inequalities it follows that Thus in order to show that

These inequalities follow from the observation that the lengths of arcs, , are maximized when Steiner point is at the center of the circle. In addition we have the following inequalities:

and

. The

Recall that

and therefore . Therefore, we need to show that From Claim 2.1 this follows.

Claim 2.1 The following identity holds, where P ROOF Observe that

Therefore it is enough to show that Let Note that and observe that

3 Open Problems As mentioned in the introduction there are many problems that can be studied by varying the domain and the set of rectiable curves. Moreover imposing constraints on the number and the placement of Steiner points opens up another dimension to these problems. Acknowledgments Many thanks to Jorge Urrutia and Christos Kaklamanis for useful conversations. References [1] Yu.D.Burago and V.A. Zalgaller, Geometric Inequalities, Springer-Verlag, page 1, 1988.

10

is odd. , since

[2] H.T. Croft, K.J.Falconer and R.K. Guy, Unsolved problems in geometry, Springer-Verlag, 1991. [3] G.N. Frederickson, Dissections: Plane and Fancy, Cambridge Univ. Press, 1997. [4] M.H. Overmars and E. Welzl, The complexity of cutting paper, Proc. 1st ACM Symposium on Computational Geometry, Baltimore, Maryland, USA, pp. 316321, 1985.

11

- 2012 2H RevisionUploaded byLinda Bieleski
- Zentangle 3 - Tangling With Rubber StampsUploaded byGlenna01
- Ch 6Uploaded byJiaJia Lau
- Problems -Chapter 29Uploaded byAfifaFarooq
- cu31924059156616Uploaded byAbhishek Seth
- Module 9 Circle Properties Worksheet and Revision GuideUploaded byDarnelle Allister-Celestine
- 9Maths Sample Papers 1Uploaded bymasoodibrahim12
- Some Notes on Eucleadean GeometryUploaded byAnup Saravan
- Basic-Drafting2.docxUploaded byGeoffrey Rainier Cartagena
- Teach Yourself GeometryUploaded byHawksmoor1888
- javier onateUploaded byapi-264759468
- CircleUploaded byjoshc445
- lec25Uploaded byADITYA
- Craig MethodUploaded byjmarinj
- the-ancient-secret-ii.pdfUploaded byVenu Gopal
- Eureka.in Standared_06 Content ListUploaded byVanessa Davis
- 01-area-under-the-curve1.pdfUploaded byAbhishek Aryan
- 2008 Fermat SolutionUploaded byscribd-in-action
- Course_Book_Sketchup_TIMZC_advancemodelling.pdfUploaded byPro Ale
- Dancing SolutionUploaded byGAURAV
- Mathematics EllipseUploaded byNikhilPrakash
- Robot and MathsUploaded byJacqueline Camilleri
- Conics 2 CirclesUploaded byMarc Lambert
- Maths Class 10thUploaded byAnivesh Mudgal
- 4.1 CirclesUploaded byKhaik Yong Lee
- Sabah T1 2011 (Question)Uploaded byShu Ck
- Math SAT Section 8Uploaded bypureconfidence
- csc reviewer.docxUploaded byGeorgeZamora
- IMG 0006 MergedUploaded byAthira Zolkiffli

- Rolf Harren- Approximating the Orthogonal Knapsack Problem for HypercubesUploaded byMnaom
- Gunter Rote- Curves with Increasing ChordsUploaded byMnaom
- Tudor Zamfirescu- On Some Questions about Convex SurfacesUploaded byMnaom
- F. K. Miyazawa and Y. Wakabayashi- Two- and Three-dimensional Parametric PackingUploaded byMnaom
- E.G. Coffman Jr, Peter J. Downey and Peter Winkler- Packing Rectangles in a StripUploaded byMnaom
- Rolf Harren- Two-Dimensional Packing ProblemsUploaded byMnaom
- Therese Biedl et al- Unfolding Some Classes of Orthogonal PolyhedraUploaded byMnaom
- Joel A. Haddley- Infinite Families of Monohedral Disk TilingsUploaded byMnaom
- Giorgio Fasano- MIP-based heuristic for non-standard 3D-packing problemsUploaded byMnaom
- Sandor P. Fekete, Tom Kamphans and Nils Schweer- Online Square PackingUploaded byMnaom
- Xin Han, Kazuo Iwama, Deshi Ye and Guochuan Zhang- Strip Packing vs. Bin PackingUploaded byMnaom
- Xin Han et al- A New Upper Bound on 2D Online Bin PackingUploaded byMnaom
- Nils Schweer- Algorithms for Packing ProblemsUploaded byMnaom
- Kari J. Nurmela and Patric R.J. Ostergard- Optimal Packings of Equal Circles in a SquareUploaded byMnaom
- Christian Icking, Rolf Klein and Elmar Langetepe- Self-Approaching CurvesUploaded byMnaom
- Xin Han, Kazuo Iwama and Guochuan Zhang- New Upper Bounds on The Approximability of 3D Strip PackingUploaded byMnaom
- F.K. Miyazawa and Y.Wakabayashi- Three-dimensional packings with rotationsUploaded byMnaom
- Wolfram Bentz- Optimal Packings of 13 and 46 Unit Squares in a SquareUploaded byMnaom
- Hiroshi Nagamochi- Packing Unit Squares in a RectangleUploaded byMnaom
- Philippe Decaudin and Fabrice Neyret- Packing Square Tiles into One TextureUploaded byMnaom
- Fan Chung and Ron Graham- Packing equal squares into a large squareUploaded byMnaom
- Klaus Jansen and Guochuan Zhang- On Rectangle Packing: Maximizing BenefitsUploaded byMnaom
- Walter Stromquist- Packing 10 or 11 Unit Squares in a SquareUploaded byMnaom
- Michael J Kearney and Peter Shiu- Efficient packing of unit squares in a squareUploaded byMnaom
- Michael D. Moffitt and Martha E. Pollack- Optimal Rectangle Packing: A Meta-CSP ApproachUploaded byMnaom
- Rolf Harren- Weighted Rectangle and Cuboid PackingUploaded byMnaom
- Florian Diedrich et al- Approximation Algorithms for 3D Orthogonal KnapsackUploaded byMnaom
- Thierry Gensane and Philippe Ryckelynck- On the Maximal Inflation of Two SquaresUploaded byMnaom
- Miroslav Chlebik and Janka Chlebikova- Hardness of approximation for orthogonal rectangle packing and covering problemsUploaded byMnaom

- Learning Outcome 1 - Ac 1 (Analytical Methods)Uploaded byChan Siew Chong
- kindergarten algebraUploaded byRoma Khaves
- ideas for progress- actUploaded byapi-197289235
- ProgrammingUploaded byHafiz Nurahim
- MathNavigator_MisconceptionsErrorUploaded byasnidar79
- Hots Info PackUploaded byHlm Mrzk
- eureka math grade 3 module 7 parent tip sheetUploaded byapi-340575766
- common core math standards jigsaw 3rd gradeUploaded byapi-28847298
- sample lesson plans and rationaleUploaded byapi-253762693
- UbD Lesson Plan for Podcasting LessonUploaded bylilyrose6
- Math Booklet First Term p6منه اللهUploaded byAbdellatif Radwan
- g8m4l8- word problems linear equationsUploaded byapi-276774049
- 13 chapter13 221-241Uploaded byapi-258749062
- stage 3 mathsUploaded byapi-208000806
- A Parcel Shape Index for Use in Land Consolidation PlanningUploaded byshin_conan
- NSTSE Class 5 SolutionUploaded byMota Chashma
- Ctet Answer Key 2015 All SetsUploaded byexams2015
- A Benchmark for 3D Mesh SegmentationUploaded byRajwant Kaur Dhaliwal
- supersource gr5-6 color tilesUploaded byapi-297357423
- MathUploaded byBryson Montemayor
- unit plan- math grade 6 revisedUploaded byapi-264279988
- CMC Freshers MaterialUploaded byamit jethwani
- Practice Test in MathUploaded bysak
- SOW_FS_L1_L2Uploaded byAlbert Awopone
- 2002 National Countdown RoundUploaded byPrecise Accuracy
- 2002 AMC 10A ProblemsUploaded byMeital Bojan
- 107 Area of Sector and Length of ArcsUploaded byJoel Gray
- Fielder - Fractal GeometryUploaded byJulio José
- 12th National ISMO Class 7 Question Paper With SolutionsUploaded byEnginBasturk
- Connect CRS to Classroom MATH.pdfUploaded byAbera Mamo