|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-32089-0 |
| 003 |
DE-He213 |
| 005 |
20230406055812.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100320s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540320890
|9 978-3-540-32089-0
|
| 024 |
7 |
|
|a 10.1007/11589440
|2 doi
|
| 050 |
|
4 |
|a T385
|
| 072 |
|
7 |
|a UML
|2 bicssc
|
| 072 |
|
7 |
|a COM012000
|2 bisacsh
|
| 072 |
|
7 |
|a UML
|2 thema
|
| 082 |
0 |
4 |
|a 006.6
|2 23
|
| 245 |
1 |
0 |
|a Discrete and Computational Geometry
|h [electronic resource] :
|b Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 /
|c edited by Jin Akiyama, Mikio Kano, Xuehou Tan.
|
| 250 |
|
|
|a 1st ed. 2005.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2005.
|
| 300 |
|
|
|a VIII, 213 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3742
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Artificial intelligence-Data processing.
|
| 650 |
|
0 |
|a Convex geometry .
|
| 650 |
|
0 |
|a Discrete geometry.
|
| 650 |
1 |
4 |
|a Computer Graphics.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Data Science.
|
| 650 |
2 |
4 |
|a Convex and Discrete Geometry.
|
| 700 |
1 |
|
|a Akiyama, Jin.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Kano, Mikio.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Tan, Xuehou.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540818083
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540304678
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3742
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11589440
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
