1 option
Discrete and Computational Geometry : Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 / edited by Jin Akiyama, Mikio Kano, Xuehou Tan.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3742.
- Theoretical Computer Science and General Issues ; 3742
- Language:
- English
- Subjects (All):
- Computer graphics.
- Computer science--Mathematics.
- Computer science.
- Algorithms.
- Data structures (Computer science).
- Convex geometry.
- Discrete geometry.
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Convex and Discrete Geometry.
- Local Subjects:
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Convex and Discrete Geometry.
- Physical Description:
- 1 online resource (VIII, 213 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-32089-0
- 9783540320890
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.