Discrete and Computational Geometry Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Akiyama, Jin (Επιμελητής έκδοσης), Kano, Mikio (Επιμελητής έκδοσης), Tan, Xuehou (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3742
• Θέματα: Computer science.; Data structures (Computer science).; Algorithms.; Computer science > Mathematics.; Computer graphics.; Convex geometry.; Discrete geometry.; Computer Science.; Computer Graphics.; Discrete Mathematics in Computer Science.; Algorithm Analysis and Problem Complexity.; Data Structures.; Convex and Discrete Geometry.

Πίνακας περιεχομένων:

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