000 03955nam a22006375i 4500
001 978-3-540-44400-8
003 DE-He213
005 20240423132554.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540444008
_9978-3-540-44400-8
024 7 _a10.1007/b11261
_2doi
050 4 _aQA440-699
072 7 _aPBM
_2bicssc
072 7 _aMAT012000
_2bisacsh
072 7 _aPBM
_2thema
082 0 4 _a516
_223
245 1 0 _aDiscrete and Computational Geometry
_h[electronic resource] :
_bJapanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers /
_cedited by Jin Akiyama, Mikio Kano.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aVIII, 292 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2866
505 0 _aUniversal Measuring Devices with Rectangular Base -- Maximin Distance for n Points in a Unit Square or a Unit Circle -- Congruent Dudeney Dissections of Polygons -- Playing with Triangulations -- The Foldings of a Square to Convex Polyhedra -- On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities -- On Partitioning a Cake -- Constrained Equitable 3-Cuttings -- On the Minimum Perimeter Triangle Enclosing a Convex Polygon -- Succinct Data Structures for Approximating Convex Functions with Applications -- Efficient Algorithms for Constructing a Pyramid from a Terrain -- On the Face Lattice of the Metric Polytope -- Partitioning a Planar Point Set into Empty Convex Polygons -- Relaxed Scheduling in Dynamic Skin Triangulation -- A Note on Point Subsets with a Specified Number of Interior Points -- Piano-Hinged Dissections: Now Let’s Fold! -- The Convex Hull for Random Lines in the Plane -- Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon -- On Reconfiguring Radial Trees -- Viewing Cube and Its Visual Angles -- Observing an Angle from Various Viewpoints -- The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere -- Maximal Number of Edges in Geometric Graphs without Convex Polygons -- Relaxing Planarity for Topological Graphs -- On the Size of a Radial Set -- Tight Bounds for Visibility Matching of f-Equal Width Objects -- Long Paths through Specified Vertices in 3-Connected Graphs -- On the Number of Intersections of Three Monochromatic Trees in the Plane -- Open Problems in Geometric Methods for Instance-Based Learning.
650 0 _aGeometry.
650 0 _aComputer graphics.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aMathematics
_xData processing.
650 1 4 _aGeometry.
650 2 4 _aComputer Graphics.
650 2 4 _aData Science.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputational Mathematics and Numerical Analysis.
700 1 _aAkiyama, Jin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKano, Mikio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540207764
776 0 8 _iPrinted edition:
_z9783662212882
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2866
856 4 0 _uhttps://doi.org/10.1007/b11261
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189265
_d189265