LEADER 03812oam 2200757I 450 001 9910821151003321 005 20240402002342.0 010 $a0-429-18609-6 010 $a1-58488-731-1 024 7 $a10.1201/b12987 035 $a(CKB)2670000000333496 035 $a(EBL)1565535 035 $a(SSID)ssj0000826693 035 $a(PQKBManifestationID)11452947 035 $a(PQKBTitleCode)TC0000826693 035 $a(PQKBWorkID)10819982 035 $a(PQKB)11361952 035 $a(MiAaPQ)EBC1565535 035 $a(Au-PeEL)EBL1565535 035 $a(CaPaEBR)ebr10653917 035 $a(CaONFJC)MIL694586 035 $a(OCoLC)828743786 035 $a(OCoLC)828078471 035 $a(OCoLC)1289858401 035 $a(FINmELB)ELB141977 035 $a(EXLCZ)992670000000333496 100 $a20180331d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aDelaunay mesh generation /$fSiu-Wing Cheng, Tamal Krishna Dey, Jonathan Richard Shewchuk 205 $a1st ed. 210 $aBoca Raton, Fla. $cTaylor & Francis$d2013 210 1$aBoca Raton :$cCRC Press,$d2013. 215 $a1 online resource (404 p.) 225 1 $aChapman & Hall/CRC computer and information science series 225 0$aChapman & Hall/CRC computer and information science series 300 $aDescription based upon print version of record. 311 $a1-322-63304-5 311 $a1-58488-730-3 320 $aIncludes bibliographical references. 327 $aFront Cover; Contents; Preface; Chapter 1: Introduction; Chapter 2: Two-dimensional Delaunay triangulations; Chapter 3: Algorithms for constructing Delaunay triangulations; Chapter 4: Three-dimensional Delaunay triangulations; Chapter 5: Algorithms for constructing Delaunay triangulations in; Chapter 6: Delaunay refinement in the plane; Chapter 7: Voronoi diagrams and weighted complexes; Chapter 8: Tetrahedral meshing of PLCs; Chapter 9: Weighted Delaunay refinement for PLCs with small angles; Chapter 10: Sliver exudation; Chapter 11: Refinement for sliver exudation 327 $aChapter 12: Smooth surfaces and point samplesChapter 13: Restricted Delaunay triangulations of surface samples; Chapter 14: Meshing smooth surfaces and volumes; Chapter 15: Meshing piecewise smooth complexes; Bibliography; Back Cover 330 $a"Going beyond, yet thoroughly rooted to theory, this book provides a comprehensive look at the algorithms that can produce quality Delaunay meshes through a paradigm called the Delaunay refinement. The authors describe meshing algorithms that can be built on the Delaunay refinement paradigm along with the involved mathematical analysis. In addition to introducing the theoretical foundation of meshing, the text discusses practical issues associated with the use of these algorithms and explores new developments in guaranteed meshing. The book also includes pseudo code as well as downloadable computer programs for meshing"--$cProvided by publisher. 410 0$aChapman & Hall/CRC computer and information science series. 606 $aNets (Mathematics) 606 $aNumerical grid generation (Numerical analysis) 606 $aTriangulation 615 0$aNets (Mathematics) 615 0$aNumerical grid generation (Numerical analysis) 615 0$aTriangulation. 676 $a514/.223 676 $a514.223 686 $aCOM051300$aSCI041000$aMAT003000$2bisacsh 700 $aCheng$b Siu-Wing.$0924866 701 $aDey$b Tamal K$g(Tamal Krishna),$f1964-$01720737 701 $aShewchuk$b Jonathan$01720738 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910821151003321 996 $aDelaunay mesh generation$94119722 997 $aUNINA