微信扫一扫,移动浏览光盘
简介
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 János 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.
目录
Matching Points with Circles and Squares
The Minimum Manhattan Network Problem: A Fast
Marc Benkert, Alexander Wolff, Florian Widmann 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
Author Index
离散与计算几何学 /会议录Discrete and Computational Geometry
- 名称
- 类型
- 大小
光盘服务联系方式: 020-38250260 客服QQ:4006604884
云图客服:
用户发送的提问,这种方式就需要有位在线客服来回答用户的问题,这种 就属于对话式的,问题是这种提问是否需要用户登录才能提问
Video Player
×
Audio Player
×
pdf Player
×