LEADER 04893nam 22008055 450 001 996466348403316 005 20200717171407.0 010 $a3-540-44400-9 024 7 $a10.1007/b11261 035 $a(CKB)1000000000212012 035 $a(SSID)ssj0000322664 035 $a(PQKBManifestationID)11268122 035 $a(PQKBTitleCode)TC0000322664 035 $a(PQKBWorkID)10287442 035 $a(PQKB)11215019 035 $a(DE-He213)978-3-540-44400-8 035 $a(MiAaPQ)EBC3088982 035 $a(PPN)155230670 035 $a(EXLCZ)991000000000212012 100 $a20121227d2003 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 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers /$fedited by Jin Akiyama, Mikio Kano 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (VIII, 292 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2866 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20776-7 320 $aIncludes bibliographical references and index. 327 $aUniversal Measuring Devices with Rectangular Base -- Maximin Distance for n Points in a Unit Square or a Unit Circle -- Congruent Dudeney Dissections of Polygons -- Playing with Triangulations -- The Foldings of a Square to Convex Polyhedra -- On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities -- On Partitioning a Cake -- Constrained Equitable 3-Cuttings -- On the Minimum Perimeter Triangle Enclosing a Convex Polygon -- Succinct Data Structures for Approximating Convex Functions with Applications -- Efficient Algorithms for Constructing a Pyramid from a Terrain -- On the Face Lattice of the Metric Polytope -- Partitioning a Planar Point Set into Empty Convex Polygons -- Relaxed Scheduling in Dynamic Skin Triangulation -- A Note on Point Subsets with a Specified Number of Interior Points -- Piano-Hinged Dissections: Now Let?s Fold! -- The Convex Hull for Random Lines in the Plane -- Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon -- On Reconfiguring Radial Trees -- Viewing Cube and Its Visual Angles -- Observing an Angle from Various Viewpoints -- The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere -- Maximal Number of Edges in Geometric Graphs without Convex Polygons -- Relaxing Planarity for Topological Graphs -- On the Size of a Radial Set -- Tight Bounds for Visibility Matching of f-Equal Width Objects -- Long Paths through Specified Vertices in 3-Connected Graphs -- On the Number of Intersections of Three Monochromatic Trees in the Plane -- Open Problems in Geometric Methods for Instance-Based Learning. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2866 606 $aGeometry 606 $aComputer graphics 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aComputer mathematics 606 $aGeometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M21006 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 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 $aComputational Mathematics and Numerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M1400X 615 0$aGeometry. 615 0$aComputer graphics. 615 0$aData structures (Computer science). 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aComputer mathematics. 615 14$aGeometry. 615 24$aComputer Graphics. 615 24$aData Structures. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputational Mathematics and Numerical Analysis. 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 712 12$aJCDCG 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466348403316 996 $aDiscrete and computational geometry$9263047 997 $aUNISA