LEADER 04369nam  22008415  450 
001 996210525503316
005 20230329224341.0
010   $a3-319-13287-3
024 7 $a10.1007/978-3-319-13287-7
035   $a(CKB)3710000000306182
035   $a(SSID)ssj0001386444
035   $a(PQKBManifestationID)11860979
035   $a(PQKBTitleCode)TC0001386444
035   $a(PQKBWorkID)11373750
035   $a(PQKB)11291044
035   $a(DE-He213)978-3-319-13287-7
035   $a(MiAaPQ)EBC6298501
035   $a(MiAaPQ)EBC5587019
035   $a(Au-PeEL)EBL5587019
035   $a(OCoLC)897803136
035   $a(PPN)183094670
035   $a(EXLCZ)993710000000306182
100   $a20141120d2014      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aDiscrete and Computational Geometry and Graphs$b[electronic resource] $e16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers /$fedited by Jin Akiyama, Hiro Ito, Toshinori Sakai
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (VIII, 191 p. 104 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8845
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-319-13286-5 
327   $aCovering Partial Cubes with Zones -- The Non-confusing Travel Groupoids on a Finite Connected Graph -- Decomposing Octilinear Polygons into Triangles and Rectangles -- On Wrapping Spheres and Cubes with Rectangular Paper -- On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case -- Online Weight Balancing on the Unit Circle -- Transformability and Reversibility of Unfoldings of Doubly-Covered Polyhedra -- Computational Complexity of the r-visibility Guard Set Problem for Polyominoes -- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane -- Generating Polygons with Triangles -- Cross-Intersecting Families of Vectors -- The Double Multicompetition Number of a Multigraph -- Computational Geometry in the Human Brain -- A Characterization of Link-2 LR-visibility Polygons with Applications -- Imaginary Hypercubes -- More Results on Clique-chromatic Numbers of Graphs with No Long Path.
330   $aThis book constitutes the thoroughly refereed post-conference proceedings of the 16th Japanese Conference on Discrete and computational Geometry and Graphs, JDCDGG 2013, held in Tokyo, Japan, in September 2013. The total of 16 papers included in this volume was carefully reviewed and selected from 58 submissions. The papers feature advances made in the field of computational geometry and focus on emerging technologies, new methodology and applications, graph theory and dynamics.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8845
606   $aComputer graphics
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aAlgorithms
606   $aArtificial intelligence?Data processing
606   $aConvex geometry
606   $aDiscrete geometry
606   $aComputer Graphics
606   $aDiscrete Mathematics in Computer Science
606   $aAlgorithms
606   $aData Science
606   $aConvex and Discrete Geometry
615  0$aComputer graphics.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aAlgorithms.
615  0$aArtificial intelligence?Data processing.
615  0$aConvex geometry.
615  0$aDiscrete geometry.
615 14$aComputer Graphics.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aAlgorithms.
615 24$aData Science.
615 24$aConvex and Discrete Geometry.
676   $a006.6
702   $aAkiyama$b Jin$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aIto$b Hiro$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSakai$b Toshinori$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996210525503316
996   $aDiscrete and Computational Geometry and Graphs$92829954
997   $aUNISA