000 06911cam a22009254a 4500
001 ocm48984012
003 OCoLC
005 20250703142746.0
006 m o d
007 cr |n|||||||||
008 010621s2001 gw a ob 101 0 eng c
010 _z 2001042885
040 _aCOO
_beng
_epn
_cCOO
_dEYM
_dNTE
_dOCLCQ
_dYNG
_dOCLCQ
_dDKDLA
_dOCLCQ
_dOCLCO
_dOCLCQ
_dGW5XE
_dOCLCF
_dOCLCQ
_dOCLCO
_dOCL
_dOCLCO
_dOCLCQ
_dYDX
_dESU
_dOCLCQ
_dVT2
_dBUF
_dTFW
_dAU@
_dCEF
_dWYU
_dOCLCQ
_dOL$
_dOCLCQ
_dAUD
_dHS0
_dUWK
_dSXB
_dOCLCQ
_dEUX
_dUKAHL
_dOCLCO
_dOCLCQ
_dWSU
_dOCLCO
_dOCLCL
_dCOA
015 _aGBA138801
_2bnb
016 7 _a007756871
_2Uk
019 _a648153923
_a768058571
_a888347816
_a990480915
_a1005785749
_a1044496798
_a1066623134
_a1081185678
_a1105592288
_a1132294534
_a1162620791
_a1164908161
_a1166195186
_a1172210304
_a1238326155
_a1340078720
020 _a9783540477389
_q(electronic bk.)
020 _a3540477381
_q(electronic bk.)
020 _z3540423060
020 _z9783540423065
024 7 _a10.1007/3-540-47738-1.
_2doi
024 8 _a(WaSeSS)ssj0000322663
029 1 _aAU@
_b000051322265
029 1 _aAU@
_b000051703952
029 1 _aAU@
_b000053215851
029 1 _aAU@
_b000058016310
029 1 _aAU@
_b000058159789
029 1 _aNZ1
_b14995874
029 1 _aNZ1
_b15295779
029 1 _aAU@
_b000060043608
035 _a(OCoLC)48984012
_z(OCoLC)648153923
_z(OCoLC)768058571
_z(OCoLC)888347816
_z(OCoLC)990480915
_z(OCoLC)1005785749
_z(OCoLC)1044496798
_z(OCoLC)1066623134
_z(OCoLC)1081185678
_z(OCoLC)1105592288
_z(OCoLC)1132294534
_z(OCoLC)1162620791
_z(OCoLC)1164908161
_z(OCoLC)1166195186
_z(OCoLC)1172210304
_z(OCoLC)1238326155
_z(OCoLC)1340078720
042 _apcc
050 4 _aQA167
_b.J33 2000
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
072 7 _aQA
_2lcco
082 0 4 _a516/.13
_221
084 _a54.73
_2bcl
084 _aPD 69
_2blsrissc
084 _aPP 15
_2blsrissc
084 _aSS 4800
_2rvk
084 _aDAT 756f
_2stub
049 _aMAIN
111 2 _aJCDCG 2000
_d(2000 :
_cTokyo, Japan)
_915941
245 1 0 _aDiscrete and computational geometry :
_bJapanese conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000 : revised papers /
_cJin Akiyama, Mikio Kano, Masatsugu Urabe (eds.).
260 _aBerlin ;
_aNew York :
_bSpringer,
_c©2001.
300 _a1 online resource (xi, 380 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
347 _bPDF
490 1 _aLecture notes in computer science,
_x0302-9743 ;
_v2098
504 _aIncludes bibliographical references and index.
520 _aThis book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers presented were carefully reviewed and selected. Among the topics covered are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, efficient algorithms, and illumination problems.
505 0 _aPapers -- Dudeney Dissections of Polygons and Polyhedrons -- A Survey -- -- Universal Measuring Devices Without Gradations -- A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square -- Sequentially Divisible Dissections of Simple Polygons -- Packing Convex Polygons into Rectangular Boxes -- On the Number of Views of Polyhedral Scenes -- Problems and Results around the Erdos-Szekeres Convex Polygon Theorem -- On Finding Maximum-Cardinality Symmetric Subsets -- Folding and Unfolding Linkages, Paper, and Polyhedra -- On the Skeleton of the Metric Polytope -- Geometric Dissections that Swing and Twist -- On Convex Decompositions of Points -- Volume Queries in Polyhedra -- Sum of Edge Lengths of a Graph Drawn on a Convex Polygon -- On double bound graphs with respect to graph operations -- Generalized Balanced Partitions of Two Sets of Points in the Plane -- On Paths in a Complete Bipartite Geometric Graph -- Approximating Uniform Triangular Meshes for Spheres -- The construction of Delaunay diagrams by lob reduction -- Geometric Transformation in Plane Triangulations -- Separation Sensitive Kinetic Separation Structures for Convex Polygons -- On Acute Triangulations of Quadrilaterals -- Intersecting Red and Blue Line Segments in Optimal Time and Precision -- Tight Error Bound of Goemetric Problems on Convex Objects with Imprecise Coordinates -- Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs -- Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces -- An Extension of Cauchy's Arm Lemma with Application to Curve Development -- On the complexity of the union of geometric objects -- Structure Theorems for Systems of Segments -- 3--Dimensional Single Active Layer Routing -- Nonregular triangulations, view graphs of triangulations, and linear programming duality -- Efficient Algorithms for Searching a Polygonal Room with a Door -- A New Structure of Cylinder Packing -- Efficient algorithms for the minimum diameter bridge problem -- Illuminating Both Sides of Line Segments.
546 _aEnglish.
650 0 _aCombinatorial geometry
_vCongresses.
_915942
650 0 _aGeometry
_xData processing
_vCongresses.
_915943
650 6 _aGéométrie combinatoire
_vCongrès.
_925967
650 6 _aGéométrie
_xInformatique
_vCongrès.
_918132
650 7 _aCombinatorial geometry
_2fast
_9482
650 7 _aGeometry
_xData processing
_2fast
_95492
655 7 _aproceedings (reports)
_2aat
655 7 _aConference papers and proceedings
_2fast
_96065
655 7 _aConference papers and proceedings.
_2lcgft
_96065
655 7 _aActes de congrès.
_2rvmgf
_9609890
700 1 _aAkiyama, J.
_915944
700 1 _aKanō, Mikio,
_d1949-
_1https://id.oclc.org/worldcat/entity/E39PCjGgg8dqPjKkByjhKPhBvb
_915945
700 1 _aUrabe, Masatsugu,
_d1960-
_1https://id.oclc.org/worldcat/entity/E39PCjycqWfFKrT3QghkDBpjJC
_915946
758 _ihas work:
_aDiscrete and computational geometry (Text)
_1https://id.oclc.org/worldcat/entity/E39PCGyg9wk4xtCmGBMPBBCxpd
_4https://id.oclc.org/worldcat/ontology/hasWork
776 0 8 _iPrint version:JCDCG 2000 (2000 : Tokyo, Japan).
_tDiscrete and computational geometry.
_dBerlin ; New York : Springer, ©2001
_z3540423060
_w(DLC) 2001042885
_w(OCoLC)47216381
830 0 _aLecture notes in computer science ;
_v2098.
_x0302-9743
856 4 0 _uhttps://link.springer.com/10.1007/3-540-47738-1
938 _aAskews and Holts Library Services
_bASKH
_nAH20756015
938 _aYBP Library Services
_bYANK
_n13351226
994 _a92
_bATIST
999 _c635350
_d635350