Discrete and Computational Geometry: Japanese Conference, Jcdcg 2004, Tokyo, Japan, October 8-11, 2004

ISBN-13: 9783540304678 / Angielski / Miękka / 2005 / 228 str.

Jin Akiyama; Mikio Kano; Xuehou Tan

Opis

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."

Spis treści

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.