04893nam 22008055 450 99646634840331620200717171407.03-540-44400-910.1007/b11261(CKB)1000000000212012(SSID)ssj0000322664(PQKBManifestationID)11268122(PQKBTitleCode)TC0000322664(PQKBWorkID)10287442(PQKB)11215019(DE-He213)978-3-540-44400-8(MiAaPQ)EBC3088982(PPN)155230670(EXLCZ)99100000000021201220121227d2003 u| 0engurnn|008mamaatxtccrDiscrete and Computational Geometry[electronic resource] Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers /edited by Jin Akiyama, Mikio Kano1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (VIII, 292 p.) Lecture Notes in Computer Science,0302-9743 ;2866Bibliographic Level Mode of Issuance: Monograph3-540-20776-7 Includes bibliographical references and index.Universal 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.Lecture Notes in Computer Science,0302-9743 ;2866GeometryComputer graphicsData structures (Computer science)AlgorithmsComputer science—MathematicsComputer mathematicsGeometryhttps://scigraph.springernature.com/ontologies/product-market-codes/M21006Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computational Mathematics and Numerical Analysishttps://scigraph.springernature.com/ontologies/product-market-codes/M1400XGeometry.Computer graphics.Data structures (Computer science).Algorithms.Computer science—Mathematics.Computer mathematics.Geometry.Computer Graphics.Data Structures.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Computational Mathematics and Numerical Analysis.516/.13Akiyama Jinedthttp://id.loc.gov/vocabulary/relators/edtKano Mikioedthttp://id.loc.gov/vocabulary/relators/edtJCDCG 2002MiAaPQMiAaPQMiAaPQBOOK996466348403316Discrete and computational geometry263047UNISA