找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(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ù)制鏈接]
查看: 21363|回復(fù): 40
樓主
發(fā)表于 2025-3-21 18:22:10 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱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:
叢書(shū)名稱Geometry and Computing
圖書(shū)封面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

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




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




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




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




書(shū)目名稱CGAL Arrangements and Their Applications被引頻次




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




書(shū)目名稱CGAL Arrangements and Their Applications年度引用




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




書(shū)目名稱CGAL Arrangements and Their Applications讀者反饋




書(shū)目名稱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

您所在的用戶組沒(méi)有投票權(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) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 23:20
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
河池市| 哈密市| 巩留县| 山阴县| 株洲市| 哈密市| 博客| 杭锦旗| 莱芜市| 遂宁市| 扎兰屯市| 黎川县| 恩平市| 罗甸县| 什邡市| 封丘县| 巴林右旗| 鄂尔多斯市| 武宁县| 辉南县| 元朗区| 石棉县| 襄城县| 莲花县| 焉耆| 那坡县| 平山县| 青龙| 平顺县| 城步| 安龙县| 宾阳县| 泰和县| 苏尼特左旗| 淳化县| 商河县| 和龙市| 南岸区| 金乡县| 白银市| 东兰县|