找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: CGAL Arrangements and Their Applications; A Step-by-Step Guide Efi Fogel,Dan Halperin,Ron Wein Textbook 2012 Springer-Verlag Berlin Heidelb

[復(fù)制鏈接]
查看: 21370|回復(fù): 40
樓主
發(fā)表于 2025-3-21 18:22:10 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱CGAL Arrangements and Their Applications
副標(biāo)題A Step-by-Step Guide
編輯Efi Fogel,Dan Halperin,Ron Wein
視頻videohttp://file.papertrans.cn/221/220266/220266.mp4
概述A practical guide to an important area of computational geometry.Contains numerous worked examples and program descriptions.Supported by a dedicated website.Includes supplementary material:
叢書名稱Geometry and Computing
圖書封面Titlebook: CGAL Arrangements and Their Applications; A Step-by-Step Guide Efi Fogel,Dan Halperin,Ron Wein Textbook 2012 Springer-Verlag Berlin Heidelb
描述.Arrangements of curves constitute fundamental structures that have been intensively studied in computational geometry. Arrangements have numerous applications in a wide range of areas – examples include geographic information systems, robot motion planning, statistics, computer-assisted surgery and molecular biology. Implementing robust algorithms for arrangements is a notoriously difficult task, and the CGAL arrangements package is the first robust, comprehensive, generic and efficient implementation of data structures and algorithms for arrangements of curves..?.This book is about how to use CGAL two-dimensional arrangements to solve problems. The authors first demonstrate the features of the arrangement package and related packages using small example programs. They then describe applications, i.e., complete standalone programs written on top of CGAL arrangements used to solve meaningful problems – for example, finding the minimum-area triangle defined by a set of points, planning the motion of a polygon translating among polygons in the plane, computing the offset polygon, finding the largest common point sets under approximate congruence, constructing the farthest-point Voron
出版日期Textbook 2012
關(guān)鍵詞Boolean set operations; Boolean set operations; CGAL; CGAL; Computational geometry; Computational geometr
版次1
doihttps://doi.org/10.1007/978-3-642-17283-0
isbn_softcover978-3-662-50712-4
isbn_ebook978-3-642-17283-0Series ISSN 1866-6795 Series E-ISSN 1866-6809
issn_series 1866-6795
copyrightSpringer-Verlag Berlin Heidelberg 2012
The information of publication is updating

書目名稱CGAL Arrangements and Their Applications影響因子(影響力)




書目名稱CGAL Arrangements and Their Applications影響因子(影響力)學(xué)科排名




書目名稱CGAL Arrangements and Their Applications網(wǎng)絡(luò)公開度




書目名稱CGAL Arrangements and Their Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱CGAL Arrangements and Their Applications被引頻次




書目名稱CGAL Arrangements and Their Applications被引頻次學(xué)科排名




書目名稱CGAL Arrangements and Their Applications年度引用




書目名稱CGAL Arrangements and Their Applications年度引用學(xué)科排名




書目名稱CGAL Arrangements and Their Applications讀者反饋




書目名稱CGAL Arrangements and Their Applications讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:15:49 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:43:59 | 只看該作者
地板
發(fā)表于 2025-3-22 05:51:48 | 只看該作者
1866-6795 the motion of a polygon translating among polygons in the plane, computing the offset polygon, finding the largest common point sets under approximate congruence, constructing the farthest-point Voron978-3-662-50712-4978-3-642-17283-0Series ISSN 1866-6795 Series E-ISSN 1866-6809
5#
發(fā)表于 2025-3-22 10:22:38 | 只看該作者
https://doi.org/10.1007/978-3-642-17283-0Boolean set operations; Boolean set operations; CGAL; CGAL; Computational geometry; Computational geometr
6#
發(fā)表于 2025-3-22 12:55:36 | 只看該作者
7#
發(fā)表于 2025-3-22 20:59:51 | 只看該作者
CGAL Arrangements and Their Applications978-3-642-17283-0Series ISSN 1866-6795 Series E-ISSN 1866-6809
8#
發(fā)表于 2025-3-23 00:27:25 | 只看該作者
9#
發(fā)表于 2025-3-23 01:24:29 | 只看該作者
10#
發(fā)表于 2025-3-23 07:21:03 | 只看該作者
10樓
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 03:02
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
阿克陶县| 图木舒克市| 乐东| 东宁县| 兴和县| 霸州市| 石渠县| 黔南| 稻城县| 南康市| 沁源县| 阳山县| 鹤壁市| 曲靖市| 阜宁县| 常山县| 长宁县| 托克逊县| 皮山县| 湘阴县| 凌源市| 栖霞市| 司法| 千阳县| 孙吴县| 海门市| 壤塘县| 南涧| 南平市| 拜泉县| 武义县| 广宁县| 桃源县| 宜君县| 奈曼旗| 沁源县| 临海市| 苍南县| 长岛县| 庆安县| 赤壁市|