网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 其它 > 其它 > 商品详情

离散与计算几何学 /会议录Discrete and Computational Geometry

分享到:
离散与计算几何学 /会议录Discrete and Computational Geometry

最 低 价:¥427.10

定 价:¥474.60

作 者:Jin Akiyama 著

出 版 社:Oversea Publishing House

出版时间:2006-1-1

I S B N:9783540304678

商品详情

编辑推荐

The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
—proceedings (published in time for the respective conference)
—post-proceedings (consisting of thoroughly revised final full papers)
—research monographs(which may be based on outstanding PhD work,research projects,technical reports,etc.)

内容简介

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

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...