04293nam 22008415 450 991048498590332120251226203444.03-540-32089-X3-540-30467-310.1007/11589440(CKB)1000000000213529(SSID)ssj0000317237(PQKBManifestationID)11211350(PQKBTitleCode)TC0000317237(PQKBWorkID)10287842(PQKB)10733105(DE-He213)978-3-540-32089-0(MiAaPQ)EBC3067963(PPN)123098688(BIP)13210715(EXLCZ)99100000000021352920100320d2005 u| 0engurnn|008mamaatxtccrDiscrete and Computational Geometry Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 /edited by Jin Akiyama, Mikio Kano, Xuehou Tan1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (VIII, 213 p.) Theoretical Computer Science and General Issues,2512-2029 ;3742Bibliographic Level Mode of Issuance: MonographPrinted edition: 9783540304678 Includes bibliographical references and index.Matching 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.This 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.Theoretical Computer Science and General Issues,2512-2029 ;3742Computer graphicsComputer scienceMathematicsDiscrete mathematicsAlgorithmsArtificial intelligenceData processingConvex geometryDiscrete geometryComputer GraphicsDiscrete Mathematics in Computer ScienceAlgorithmsData ScienceConvex and Discrete GeometryComputer graphics.Computer scienceMathematics.Discrete mathematics.Algorithms.Artificial intelligenceData processing.Convex geometry.Discrete geometry.Computer Graphics.Discrete Mathematics in Computer Science.Algorithms.Data Science.Convex and Discrete Geometry.516/.11Akiyama J1609637Kanō Mikio1949-0Tan Xuehou598013MiAaPQMiAaPQMiAaPQBOOK9910484985903321Discrete and computational geometry4193155UNINA