product iamge

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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Bernardo M. Ábrego, Esther M. Arkin (auth.), Jin Akiyama, Mikio Kano, Xuehou Tan (eds.)
Series: Lecture Notes in Computer Science 3742 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005

Language: English
Pages: 213
Tags: Computer Graphics; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Data Structures; Convex and Discrete Geometry

Front Matter....Pages -
Matching Points with Circles and Squares....Pages 1-15
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation....Pages 16-28
Algorithms for the d -Dimensional Rigidity Matroid of Sparse Graphs....Pages 29-36
Sliding Disks in the Plane....Pages 37-47
Weighted Ham-Sandwich Cuts....Pages 48-53
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane....Pages 54-61
Farthest-Point Queries with Geometric and Combinatorial Constraints....Pages 62-75
Grid Vertex-Unfolding Orthostacks....Pages 76-82
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem....Pages 83-94
Tight Time Bounds for the Minimum Local Convex Partition Problem....Pages 95-105
I/O-Efficiently Pruning Dense Spanners....Pages 106-116
On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons....Pages 117-122
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon....Pages 123-130
Wedges in Euclidean Arrangements....Pages 131-142
Visual Pascal Configuration and Quartic Surface....Pages 143-150
Nonexistence of 2-Reptile Simplices....Pages 151-160
Single-Vertex Origami and Spherical Expansive Motions....Pages 161-173
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms....Pages 174-183
Crossing Stars in Topological Graphs....Pages 184-197
The Geometry of Musical Rhythm....Pages 198-212
Back Matter....Pages -