Koha online

Your cart is empty.
Normal view MARC view ISBD view

Discrete and Computational Geometry [electronic resource] :Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers / edited by Jin Akiyama, Mikio Kano, Xuehou Tan.

by Akiyama, Jin [editor.]; Kano, Mikio [editor.]; Tan, Xuehou [editor.]; SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 3742Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: VIII, 213 p. Also available online. online resource.ISBN: 9783540320890.Subject(s): Computer science | Data structures (Computer science) | Computer software | Computational complexity | Computer graphics | Discrete groups | Computer Science | Computer Graphics | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Data Structures | Convex and Discrete GeometryDDC classification: 006.6 Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)

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.

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.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha