Finding the largest inscribed axially symmetric polygon for a convex polygon볼록다각형에서 최대의 내접 대칭 다각형 찾기

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 511
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChoeng, Otfried-
dc.contributor.advisor정지원-
dc.contributor.authorChoi, Chang-Yul-
dc.contributor.author최창렬-
dc.date.accessioned2011-12-13T06:06:50Z-
dc.date.available2011-12-13T06:06:50Z-
dc.date.issued2007-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=265061&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/34780-
dc.description학위논문(석사) - 한국과학기술원 : 전산학전공, 2007.2, [ vi, 22 p. ]-
dc.description.abstractA planar figure F is axially-symmetric if there is a line l such that reflection around l leaves F invariant. We consider the following problem: Given a compact convex figure C in the plane of area one, what is the area γ(C) of the largest axially-symmetric figure F inscribed in C? We are interested in the worst case, that is, in γ := inf_Cγ(C), where the infimum is taken over all compact convex figures C of area one in the plane. Lassak proved that γ >= 2/3, that is, for every convex compact figure C of area one, there is an inscribed axially-symmetric figure of area at least 2/3. For the special case that C is a triangle, Buda and Mislow proved that $γ = 2(root{2} - 1)$. Interestingly, Nohl showed exactly the same bound $γ = 2(root{2} - 1)$ for centrally symmetric convex figures C. Both bounds are tight - there is a triangle and a parallelogram of area one that do not admit an axially symmetric subset of area larger than $2(root{2} - 1)$. For general, not centrally symmetric convex figures, there is still a large gap: $2/3 <= γ <= 2(root{2} - 1)$. Since the upper bound is the correct answer for both triangles and centrally-symmetric figures, one might conjecture that it is the correct bound in general. We will show that this conjecture is false: We have performed experiments in which we generated convex polygons in the plane, and then computed the largest inscribed axially-symmetric subset. From our experiments, we conjecture that the true bound is around 0.81, which is less than $2(root{2} - 1)$, but much higher than the known lower bound of 2/3. The worst case seems to arise for convex quadrilaterals. We give an explicit example of a convex quadrilateral that does not admit an axially symmetric subset of area larger than 0.8158382599948. Since this bound is only slightly smaller than the conjecture we are disproving, and since we can only compute the largest axially-symmetric subset approximately, we have to make a considerable effort t...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectconvex polygon-
dc.subjectinscribed axially symmetric-
dc.subject내접 대칭-
dc.subject볼록다각형-
dc.titleFinding the largest inscribed axially symmetric polygon for a convex polygon-
dc.title.alternative볼록다각형에서 최대의 내접 대칭 다각형 찾기-
dc.typeThesis(Master)-
dc.identifier.CNRN265061/325007 -
dc.description.department한국과학기술원 : 전산학전공, -
dc.identifier.uid020053620-
dc.contributor.localauthorChoeng, Otfried-
dc.contributor.localauthor정지원-
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0