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

Author:   Jin Akiyama ,  Mikio Kano ,  Xuehou Tan
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   2005 ed.
Volume:   3742
ISBN:  

9783540304678


Pages:   213
Publication Date:   24 November 2005
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $153.12 Quantity:  
Add to Cart

Share |

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


Add your own review!

Overview

Full Product Details

Author:   Jin Akiyama ,  Mikio Kano ,  Xuehou Tan
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2005 ed.
Volume:   3742
Dimensions:   Width: 15.50cm , Height: 1.20cm , Length: 23.50cm
Weight:   0.730kg
ISBN:  

9783540304678


ISBN 10:   3540304673
Pages:   213
Publication Date:   24 November 2005
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

Aorrng

Shopping Cart
Your cart is empty
Shopping cart
Mailing List