LEADER 03045nam 2200589 a 450 001 9910484985903321 005 20200520144314.0 010 $a3-540-32089-X 010 $a3-540-30467-3 024 7 $a10.1007/11589440 035 $a(CKB)1000000000213529 035 $a(SSID)ssj0000317237 035 $a(PQKBManifestationID)11211350 035 $a(PQKBTitleCode)TC0000317237 035 $a(PQKBWorkID)10287842 035 $a(PQKB)10733105 035 $a(DE-He213)978-3-540-32089-0 035 $a(MiAaPQ)EBC3067963 035 $a(PPN)123098688 035 $a(EXLCZ)991000000000213529 100 $a20051102d2005 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDiscrete and computational geometry $eJapanese conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 : revised selected papers /$fJin Akiyama, Mikio Kano, Xuehou Tan (eds.) 205 $a1st ed. 2005. 210 $aBerlin ;$aNew York $cSpringer$dc2005 215 $a1 online resource (VIII, 213 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3742 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540304678 320 $aIncludes bibliographical references and index. 327 $aMatching Points with Circles and Squares -- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation -- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs -- Sliding Disks in the Plane -- Weighted Ham-Sandwich Cuts -- Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane -- Farthest-Point Queries with Geometric and Combinatorial Constraints -- Grid Vertex-Unfolding Orthostacks -- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem -- Tight Time Bounds for the Minimum Local Convex Partition Problem -- I/O-Efficiently Pruning Dense Spanners -- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons -- Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon -- Wedges in Euclidean Arrangements -- Visual Pascal Configuration and Quartic Surface -- Nonexistence of 2-Reptile Simplices -- Single-Vertex Origami and Spherical Expansive Motions -- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms -- Crossing Stars in Topological Graphs -- The Geometry of Musical Rhythm. 410 0$aLecture notes in computer science ;$v3742. 517 3 $aJCDCG 2004 606 $aCombinatorial geometry$vCongresses 606 $aGeometry$xData processing$vCongresses 615 0$aCombinatorial geometry 615 0$aGeometry$xData processing 676 $a516/.11 701 $aAkiyama$b J$01609637 701 $aKano$b Mikio$f1949-$0512838 701 $aTan$b Xuehou$0598013 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484985903321 996 $aDiscrete and computational geometry$94193155 997 $aUNINA