- ホーム
- > 洋書
- > 英文書
- > Computer / General
Full Description
This volume consists of the refereed proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2004) held at Tokai University in Tokyo, Japan, October, 8-11, 2004, to honor Jan ' os Pach on his 50th year. J' anos Pach has generously supported the e?orts to promote research in discrete and computational geometry among mathematicians in Asia for many years. The conference was attended by close to 100 participants from 20 countries. Since it was ?rst organized in 1997, the annual JCDCG has attracted a growing international participation. The earlier conferences were held in Tokyo, followed by conferences in Manila, Philippines, and Bandung, Indonesia. The proceedings of JCDCG 1998, 2000, 2002 and IJCCGGT 2003 were published by SpringeraspartoftheseriesLectureNotesinComputerScience(LNCS)volumes 1763, 2098, 2866 and 3330, respectively, while the proceedings of JCDCG 2001 were also published by Springer as a special issue of the journal Graphs and Combinatorics, Vol. 18, No. 4, 2002.
The organizers of JCDCG 2004 gratefully acknowledge the sponsorship of Tokai University, the support of the conference secretariat and the partici- tion of the principal speakers: Ferran Hurtado, Hiro Ito, Alberto M' arquez, Ji? r' ? Matou? sek, Ja 'nos Pach, Jonathan Shewchuk, William Steiger, Endre Szemer' edi, G' eza T' oth, Godfried Toussaint and Jorge Urrutia.
Contents
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.
