Geometric Dissection

At the beginning of this project, the dissection of some polygons were studied and analysed. One of them is the solution of Haberdasher’s problem which is a four-pieces dissection from an equilateral triangle to a square given by Henry Dudeney. His original construction idea is applied to construct...

Full description

Bibliographic Details
Main Author: Leong, Yee Hang
Format: Final Year Project / Dissertation / Thesis
Published: 2020
Subjects:
Online Access:http://eprints.utar.edu.my/4198/
http://eprints.utar.edu.my/4198/1/1700375_LEONG_YEE_HANG_GEOMETRIC_DISSECTION.pdf
_version_ 1848886096308469760
author Leong, Yee Hang
author_facet Leong, Yee Hang
author_sort Leong, Yee Hang
building UTAR Institutional Repository
collection Online Access
description At the beginning of this project, the dissection of some polygons were studied and analysed. One of them is the solution of Haberdasher’s problem which is a four-pieces dissection from an equilateral triangle to a square given by Henry Dudeney. His original construction idea is applied to construct the dissection from a square to an equilateral triangle. After that, equidecomposability of polygons and polyhedra are discussed. Wallace-Bolyai-Gerwien Theorem states that any polygons with same area are equidecomposable. Two proofs for this theorem are given. A stronger result tells that equidecomposable polygons have a common hinged dissection. Hilbert’s Third Problem asks whether two polyhedra of equal volume are equidecomposable. Max Dehn gave an negative answer to this problem. A recent alternative solution based on Bricard’s condition is studied.
first_indexed 2025-11-15T19:33:03Z
format Final Year Project / Dissertation / Thesis
id utar-4198
institution Universiti Tunku Abdul Rahman
institution_category Local University
last_indexed 2025-11-15T19:33:03Z
publishDate 2020
recordtype eprints
repository_type Digital Repository
spelling utar-41982021-08-09T11:54:42Z Geometric Dissection Leong, Yee Hang QA Mathematics QA75 Electronic computers. Computer science At the beginning of this project, the dissection of some polygons were studied and analysed. One of them is the solution of Haberdasher’s problem which is a four-pieces dissection from an equilateral triangle to a square given by Henry Dudeney. His original construction idea is applied to construct the dissection from a square to an equilateral triangle. After that, equidecomposability of polygons and polyhedra are discussed. Wallace-Bolyai-Gerwien Theorem states that any polygons with same area are equidecomposable. Two proofs for this theorem are given. A stronger result tells that equidecomposable polygons have a common hinged dissection. Hilbert’s Third Problem asks whether two polyhedra of equal volume are equidecomposable. Max Dehn gave an negative answer to this problem. A recent alternative solution based on Bricard’s condition is studied. 2020 Final Year Project / Dissertation / Thesis NonPeerReviewed application/pdf http://eprints.utar.edu.my/4198/1/1700375_LEONG_YEE_HANG_GEOMETRIC_DISSECTION.pdf Leong, Yee Hang (2020) Geometric Dissection. Final Year Project, UTAR. http://eprints.utar.edu.my/4198/
spellingShingle QA Mathematics
QA75 Electronic computers. Computer science
Leong, Yee Hang
Geometric Dissection
title Geometric Dissection
title_full Geometric Dissection
title_fullStr Geometric Dissection
title_full_unstemmed Geometric Dissection
title_short Geometric Dissection
title_sort geometric dissection
topic QA Mathematics
QA75 Electronic computers. Computer science
url http://eprints.utar.edu.my/4198/
http://eprints.utar.edu.my/4198/1/1700375_LEONG_YEE_HANG_GEOMETRIC_DISSECTION.pdf