Introduction to Computational Origami: The World of New Computational Geometry
暫譯: 計算摺紙入門:新計算幾何的世界
Uehara, Ryuhei
- 出版商: Springer
- 出版日期: 2020-06-30
- 售價: $4,130
- 貴賓價: 9.5 折 $3,924
- 語言: 英文
- 頁數: 220
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 9811544697
- ISBN-13: 9789811544699
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$380$300 -
$1,450$1,421 -
$360$281 -
$594$564 -
$403企業應用架構模式 (Patterns of Enterprise Application Architecture)
-
$420$357 -
$450$405 -
$301軟件設計重構
-
$454深入淺出:Windows 10通用應用開發
-
$199軟件開發本質論:追求簡約、體現價值、逐步構建 (The Nature of Software Development: Keep It Simple, Make It Valuable, Build It Piece by Piece)
-
$390$304 -
$834$792 -
$474$450 -
$709OpenGL 編程指南, 9/e (OpenGL Programming Guide:the Official Guide to Learning OpenGl Version 4.5 with SPIR-V, 9/e)
-
$330$314 -
$594$564 -
$306現代 API : 通往架構師之門
-
$500$390 -
$720$612 -
$480$379 -
$1,014$963 -
$474$450 -
$454深度實踐 OCR:基於深度學習的文字識別
-
$352$331 -
$1,000$850
商品描述
This book focuses on origami from the point of view of computer science. Ranging from basic theorems to the latest research results, the book introduces the considerably new and fertile research field of computational origami as computer science.
Part I introduces basic knowledge of the geometry of development, also called a net, of a solid. Part II further details the topic of nets. In the science of nets, there are numerous unresolved issues, and mathematical characterization and the development of efficient algorithms by computer are closely connected with each other. Part III discusses folding models and their computational complexity. When a folding model is fixed, to find efficient ways of folding is to propose efficient algorithms. If this is difficult, it is intractable in terms of computational complexity. This is, precisely, an area for computer science research. Part IV presents some of the latest research topics as advanced problems. Commentaries on all exercises included in the last chapter.
The contents are organized in a self-contained way, and no previous knowledge is required. This book is suitable for undergraduate, graduate, and even high school students, as well as researchers and engineers interested in origami.
商品描述(中文翻譯)
這本書從計算機科學的角度探討摺紙。書中涵蓋了從基本定理到最新研究成果,介紹了計算摺紙這一相當新穎且富有潛力的研究領域。
第一部分介紹了固體的發展幾何學的基本知識,也稱為網格。第二部分進一步詳細說明了網格的主題。在網格科學中,有許多未解決的問題,數學特徵化與計算機高效算法的開發彼此密切相關。第三部分討論了摺疊模型及其計算複雜性。當摺疊模型固定時,尋找高效的摺疊方法就是提出高效算法。如果這很困難,則在計算複雜性方面是不可解的。這正是計算機科學研究的一個領域。第四部分介紹了一些最新的研究主題作為進階問題。最後一章包含所有練習題的評論。
內容以自足的方式組織,無需先前的知識。本書適合本科生、研究生,甚至高中生,以及對摺紙感興趣的研究人員和工程師。
作者簡介
Ryuhei Uehara is a professor in the School of Information Science at the Japan Advanced Institute of Science and Technology. After working as a researcher at Canon Inc., he joined Tokyo Woman's Christian University as an assistant professor. He was later a lecturer and associate professor at Komazawa University. He was a visiting scholar at the University of Waterloo (Canada), the Massachusetts Institute of Technology (USA), Simon Fraser University (Canada), Université libre de Bruxelles (Belgium), ETH Zürich (Switzerland), and Universitat Politècnica de Catalunya (Spain). His research interests include computational complexity, algorithms and data structures, and graph algorithms. He is especially engrossed in computational origami, games, and puzzles from the point of view of theoretical computer science. He is one of two translators of the New Martin Gardner Mathematical Library into Japanese.
作者簡介(中文翻譯)
上原龍平是日本先進科學技術研究所資訊科學學院的教授。在佳能公司擔任研究員後,他加入東京女子基督教大學擔任助理教授。之後,他在駒澤大學擔任講師和副教授。他曾是滑鐵盧大學(加拿大)、麻省理工學院(美國)、西門菲莎大學(加拿大)、布魯塞爾自由大學(比利時)、瑞士聯邦理工學院(ETH Zurich)和加泰羅尼亞理工大學(西班牙)的訪問學者。他的研究興趣包括計算複雜性、演算法和資料結構,以及圖形演算法。他特別專注於計算摺紙、遊戲和謎題,從理論計算機科學的角度進行研究。他是《新馬丁·加德納數學圖書館》日文版的兩位翻譯者之一。