LEADER 04296nam 22008415 450 001 9910484985903321 005 20251226203444.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(BIP)13210715 035 $a(EXLCZ)991000000000213529 100 $a20100320d2005 u| 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 /$fedited by Jin Akiyama, Mikio Kano, Xuehou Tan 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (VIII, 213 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$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. 330 $aThis book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2004, held in Tokyo, Japan in October 2004, to honor Janos Pach on his fiftieth year. The 20 revised full papers presented were carefully selected during two rounds of reviewing and improvement from over 60 talks at the conference. All current issues in discrete algorithmic geometry are addressed. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3742 606 $aComputer graphics 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aArtificial intelligence$xData 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$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData 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 $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