000 03567nam a22006255i 4500
001 978-3-540-32089-0
003 DE-He213
005 20240730192612.0
007 cr nn 008mamaa
008 100320s2005 gw | s |||| 0|eng d
020 _a9783540320890
_9978-3-540-32089-0
024 7 _a10.1007/11589440
_2doi
050 4 _aT385
072 7 _aUML
_2bicssc
072 7 _aCOM012000
_2bisacsh
072 7 _aUML
_2thema
082 0 4 _a006.6
_223
245 1 0 _aDiscrete and Computational Geometry
_h[electronic resource] :
_bJapanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004 /
_cedited by Jin Akiyama, Mikio Kano, Xuehou Tan.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aVIII, 213 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3742
505 0 _aMatching 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 _aComputer graphics.
_94088
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aConvex geometry .
_985646
650 0 _aDiscrete geometry.
_985648
650 1 4 _aComputer Graphics.
_94088
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
650 2 4 _aConvex and Discrete Geometry.
_985650
700 1 _aAkiyama, Jin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150628
700 1 _aKano, Mikio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150629
700 1 _aTan, Xuehou.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9150630
710 2 _aSpringerLink (Online service)
_9150631
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540304678
776 0 8 _iPrinted edition:
_z9783540818083
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3742
_9150632
856 4 0 _uhttps://doi.org/10.1007/11589440
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94341
_d94341