LEADER 05362nam 22008175 450 001 996465817503316 005 20200706085341.0 010 $a3-540-47738-1 024 7 $a10.1007/3-540-47738-1 035 $a(CKB)1000000000211508 035 $a(SSID)ssj0000322663 035 $a(PQKBManifestationID)11246299 035 $a(PQKBTitleCode)TC0000322663 035 $a(PQKBWorkID)10286884 035 $a(PQKB)10787448 035 $a(DE-He213)978-3-540-47738-9 035 $a(MiAaPQ)EBC3072035 035 $a(PPN)15518332X 035 $a(EXLCZ)991000000000211508 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDiscrete and Computational Geometry$b[electronic resource] $eJapanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers /$fedited by Jin Akiyama, Mikio Kano, Masatsugu Urabe 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 388 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2098 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42306-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aPapers -- Dudeney Dissections of Polygons and Polyhedrons ? A Survey ? -- Universal Measuring Devices Without Gradations -- A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square -- Sequentially Divisible Dissections of Simple Polygons -- Packing Convex Polygons into Rectangular Boxes -- On the Number of Views of Polyhedral Scenes -- Problems and Results around the Erdös-Szekeres Convex Polygon Theorem -- On Finding Maximum-Cardinality Symmetric Subsets -- Folding and Unfolding Linkages, Paper, and Polyhedra -- On the Skeleton of the Metric Polytope -- Geometric Dissections that Swing and Twist -- On Convex Decompositions of Points -- Volume Queries in Polyhedra -- Sum of Edge Lengths of a Graph Drawn on a Convex Polygon -- On double bound graphs with respect to graph operations -- Generalized Balanced Partitions of Two Sets of Points in the Plane -- On Paths in a Complete Bipartite Geometric Graph -- Approximating Uniform Triangular Meshes for Spheres -- The construction of Delaunay diagrams by lob reduction -- Geometric Transformation in Plane Triangulations -- Separation Sensitive Kinetic Separation Structures for Convex Polygons -- On Acute Triangulations of Quadrilaterals -- Intersecting Red and Blue Line Segments in Optimal Time and Precision -- Tight Error Bound of Goemetric Problems on Convex Objects with Imprecise Coordinates -- Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs -- Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces -- An Extension of Cauchy?s Arm Lemma with Application to Curve Development -- On the complexity of the union of geometric objects -- Structure Theorems for Systems of Segments -- 3?Dimensional Single Active Layer Routing -- Nonregular triangulations, view graphs of triangulations, and linear programming duality -- Efficient Algorithms for Searching a Polygonal Room with a Door -- A New Structure of Cylinder Packing -- Efficient algorithms for the minimum diameter bridge problem -- Illuminating Both Sides of Line Segments. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2098 606 $aComputers 606 $aGeometry 606 $aApplication software 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aGeometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M21006 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aGeometry. 615 0$aApplication software. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aGeometry. 615 24$aComputer Applications. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a516.13 702 $aAkiyama$b Jin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKano$b Mikio$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aUrabe$b Masatsugu$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aJCDCG 2000 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465817503316 996 $aDiscrete and computational geometry$9263047 997 $aUNISA