Discrete and Computational Geometry Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 / [electronic resource] :
edited by Jin Akiyama, Mikio Kano, Xuehou Tan.
- 1st ed. 2005.
- VIII, 213 p. online resource.
- Theoretical Computer Science and General Issues, 3742 2512-2029 ; .
- Theoretical Computer Science and General Issues, 3742 .
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.
9783540320890
10.1007/11589440 doi
Computer graphics.
Computer science--Mathematics.
Discrete mathematics.
Algorithms.
Artificial intelligence--Data processing.
Convex geometry .
Discrete geometry.
Computer Graphics.
Discrete Mathematics in Computer Science.
Algorithms.
Data Science.
Convex and Discrete Geometry.
T385
006.6
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.
9783540320890
10.1007/11589440 doi
Computer graphics.
Computer science--Mathematics.
Discrete mathematics.
Algorithms.
Artificial intelligence--Data processing.
Convex geometry .
Discrete geometry.
Computer Graphics.
Discrete Mathematics in Computer Science.
Algorithms.
Data Science.
Convex and Discrete Geometry.
T385
006.6