|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910484985903321 |
|
|
Titolo |
Discrete and computational geometry : Japanese conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 : revised selected papers / / Jin Akiyama, Mikio Kano, Xuehou Tan (eds.) |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin ; ; New York, : Springer, c2005 |
|
|
|
|
|
|
|
ISBN |
|
3-540-32089-X |
3-540-30467-3 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2005.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 213 p.) |
|
|
|
|
|
|
Collana |
|
Lecture notes in computer science, , 0302-9743 ; ; 3742 |
|
|
|
|
|
|
Altri autori (Persone) |
|
AkiyamaJ |
KanoMikio <1949-> |
TanXuehou |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Combinatorial geometry |
Geometry - Data processing |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|