|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465731403316 |
|
|
Titolo |
Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 / / edited by Jin Akiyama, Mikio Kano, Xuehou Tan |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
|
|
|
|
|
|
|
|
|
ISBN |
|
3-540-32089-X |
3-540-30467-3 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2005.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 213 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 3742 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer graphics |
Computer science—Mathematics |
Discrete mathematics |
Algorithms |
Artificial intelligence—Data processing |
Convex geometry |
Discrete geometry |
Computer Graphics |
Discrete Mathematics in Computer Science |
Data Science |
Convex and Discrete Geometry |
|
|
|
|
|
|
|
|
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 -- |
|
|
|
|