Details

Autor(en) / Beteiligte

• JCDCG 2004
• Akiyama, Jin[Herausgeber]
• Kano, Mikio[Herausgeber]
• Tan, Xuehou[Herausgeber]

Titel

Discrete and Computational Geometry : Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 [electronic resource]

Auflage

1st ed. 2005

Ort / Verlag

Berlin, Heidelberg : Springer Berlin Heidelberg

Erscheinungsjahr

2005

Link zum Volltext

• SpringerLink Books - AutoHoldings

Beschreibungen/Notizen

• Bibliographic Level Mode of Issuance: Monograph
• 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.
• English