English  |  正體中文  |  简体中文  |  Items with full text/Total items : 75369/75369 (100%) Visitors : 25579771      Online Users : 415
 Scope All of NCUIR College of Electrical Engineering & Computer Science    Graduate Institute of Computer Science and Information Engineering       --Electronic Thesis & Dissertation Tips: please add "double quotation mark" for query phrases to get precise resultsplease goto advance search for comprehansive author search Adv. Search
 NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > Electronic Thesis & Dissertation >  Item 987654321/69003

 Please use this identifier to cite or link to this item: `http://ir.lib.ncu.edu.tw/handle/987654321/69003`

 Title: A Study on the Minimum Area of Rectilinear Polygons Realized by Turn Sequences Authors: 林鈞仁;Lin,Chun-Jen Contributors: 資訊工程學系 Keywords: 直角多邊形;頂點角度序列;最小面積;凸多邊形;rectilinear polygon;turn sequence;minimum area;monotone Date: 2015-08-31 Issue Date: 2015-09-23 14:52:44 (UTC+8) Publisher: 國立中央大學 Abstract: 在本論文中，我們考慮以其頂點角度之序列，來重建最小面積直角多邊形的問題。我們提出以下兩個結果： 1. 研究n 點的最小面積直角多邊形的性質，並以此性質將之分為四類，以及算出其中三類多邊形的個數。 2. 給定一直角凸多邊形之角度序列S，我們提出一計算其最小面積之公式。;In this thesis, we consider the problem of reconstructing rectilinear polygons with minimum area, from a sequence of angles of vertices. We provide two results: 1. Studying properties of n-vertex rectilinear polygons with minimum area, classifying those polygons into four types by these properties, and computing the number of polygons in each of three of them. 2. Given a sequence S of angles of a monotone rectilinear polygon, we propose a formula to compute the minimum of area of monotone rectilinear polygons with turn sequence S. Appears in Collections: [Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File Description SizeFormat
index.html0KbHTML381View/Open