000 06343cam a22009494a 4500
001 ocn243487649
003 OCoLC
005 20250703144444.0
006 m o d
007 cr |n|||||||||
008 000223s2000 gw a ob 101 0 eng c
010 _z 00023693
040 _aCOO
_beng
_epn
_cCOO
_dSFB
_dWAU
_dOCLCQ
_dYNG
_dOCLCQ
_dDKDLA
_dOCLCQ
_dGW5XE
_dOCLCF
_dOCLCQ
_dOCLCO
_dOCLCQ
_dOCL
_dOCLCO
_dEBLCP
_dOCLCO
_dOCLCQ
_dOCLCO
_dYDX
_dSHS
_dUAB
_dESU
_dOCLCQ
_dVT2
_dBUF
_dTFW
_dCEF
_dAU@
_dWYU
_dOCLCQ
_dLEAUB
_dOCLCQ
_dOL$
_dOCLCQ
_dAUD
_dOCLCQ
_dEUX
_dOCLCQ
_dUKAHL
_dOCLCO
_dOCLCQ
_dWSU
_dOCLCO
_dCOA
_dQGK
_dOCLCO
015 _aGBA019143
_2bnb
016 7 _a007758235
_2Uk
019 _a648153920
_a771187360
_a934979088
_a990467123
_a1005763858
_a1044536098
_a1066422104
_a1081246118
_a1127163435
_a1136437547
_a1162741966
_a1238318201
_a1259245410
_a1340115308
020 _a9783540465157
_q(electronic bk.)
020 _a3540465154
_q(electronic bk.)
020 _z3540671811
020 _z9783540671817
024 7 _a10.1007/b75044
_2doi
024 8 _a(WaSeSS)ssj0000322662
029 1 _aAU@
_b000051322268
029 1 _aAU@
_b000051697741
029 1 _aAU@
_b000058016601
029 1 _aNZ1
_b14995046
029 1 _aNZ1
_b15298015
029 1 _aDKDLA
_b820120-katalog:999920719405765
035 _a(OCoLC)243487649
_z(OCoLC)648153920
_z(OCoLC)771187360
_z(OCoLC)934979088
_z(OCoLC)990467123
_z(OCoLC)1005763858
_z(OCoLC)1044536098
_z(OCoLC)1066422104
_z(OCoLC)1081246118
_z(OCoLC)1127163435
_z(OCoLC)1136437547
_z(OCoLC)1162741966
_z(OCoLC)1238318201
_z(OCoLC)1259245410
_z(OCoLC)1340115308
042 _apcc
050 4 _aQA167
_b.J33 1998
072 7 _aUML
_2bicssc
072 7 _aCOM012000
_2bisacsh
082 0 4 _a516/.13
_221
084 _a54.73
_2bcl
084 _aPP 15
_2blsrissc
084 _aSS 4800
_2rvk
084 _aDAT 756f
_2stub
049 _aMAIN
111 2 _aJCDCG '98
_d(1998 :
_cTokyo, Japan)
_925566
245 1 0 _aDiscrete and computational geometry :
_bJapanese conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, revised papers /
_cJin Akiyama, Mikio Kano, Masatsugu Urabe (eds.).
260 _aBerlin ;
_aNew York :
_bSpringer,
_c©2000.
300 _a1 online resource (viii, 331 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 ;
_v1763
504 _aIncludes bibliographical references and index.
520 _aThis book constitutes the thoroughly refereed post-conference proceedings of the Second Japanese Conference on Discrete and Computational Geometry, JCDCG8, held in Tokyo, Japan, in December 1999. The 27 revised full papers presented were carefully reviewed and selected for inclusion in the post-conference proceedings. Among the topics addressed are approximation, convex hulls, lattice computations, tilings, graph computations, Voronoi diagrams, clustering, graph drawing, diagram design, and illumination problems.
505 0 _aPapers -- Radial Perfect Partitions of Convex Sets in the Plane -- Dudeney Dissection of Polygons -- Effective Use of Geometric Properties for Clustering -- Living with lrs -- On the Existente of a Point Subset with 4 or 5 Interior Points -- Planar Drawing Algorithms of Survivable Telecommunication Networks -- Polygon Cutting: Revisited -- Algorithms for Packing Two Circles in a Convex Polygon -- Folding and Cutting Paper -- An Interpolant Based on Line Segment Voronoi Diagrams -- 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces -- NP-Completeness of Stage Illumination Problems -- On the Maximum Degree of Bipartite Embeddings of Trees in the Plane -- Efficient Regular Polygon Dissections -- On Soddy's Hexlet and a Linked 4-Pair -- Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs -- Visibility of Disks on the Lattice Points -- Convex Hull Problem with Imprecise Input -- One-Dimensional Tilings with Congruent Copies of a 3-Point Set -- Polygonal Approximations for Curved Problems: An Application to Arrangements -- Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms -- Folding and Unfolding in Computational Geometry -- Crossing Numbers -- A Note on the Existente of Plane Spanning Trees of Geometrie Graphs -- Embeddings of Equilateral Polygons in Unit Lattices -- Order-k Voronoi Diagrams, k-Sections, and k-Sets -- "Impossible Objects" Are Not Necessarily Impossible -- Mathematical Study on Optical Illusion -- -- An Efficient Solution to the Corridor Search Problem.
546 _aEnglish.
650 0 _aCombinatorial geometry
_vCongresses.
_915942
650 0 _aGeometry
_xData processing
_vCongresses.
_915943
650 0 _aComputer graphics.
_9371
650 6 _aGéométrie combinatoire
_vCongrès.
_925967
650 6 _aGéométrie
_xInformatique
_vCongrès.
_918132
650 6 _aOrdinateurs.
_996685
650 6 _aInfographie.
_919094
650 6 _aAlgorithmes.
_916327
650 7 _ageometry.
_2aat
_92664
650 7 _acomputers.
_2aat
_91420
650 7 _acomputer graphics.
_2aat
_9371
650 7 _aalgorithms.
_2aat
_9864
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
776 0 8 _iPrint version:JCDCG '98 (1998 : Tokyo, Japan)
_tDiscrete and computational geometry : Japanese conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, revised papers
_w(OCoLC)43561898
830 0 _aLecture notes in computer science ;
_v1763.
_x0302-9743
856 4 0 _uhttps://link.springer.com/10.1007/b75044
938 _aAskews and Holts Library Services
_bASKH
_nAH29630227
938 _aProQuest Ebook Central
_bEBLB
_nEBL3087555
938 _aYBP Library Services
_bYANK
_n13357728
994 _a92
_bATIST
999 _c637099
_d637099