|
|
|
|
| LEADER |
03047nmm a2200385 u 4500 |
| 001 |
EB000655705 |
| 003 |
EBX01000000000000000508787 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540444008
|
| 100 |
1 |
|
|a Akiyama, Jin
|e [editor]
|
| 245 |
0 |
0 |
|a Discrete and Computational Geometry
|h Elektronische Ressource
|b Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers
|c edited by Jin Akiyama, Mikio Kano
|
| 250 |
|
|
|a 1st ed. 2003
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2003, 2003
|
| 300 |
|
|
|a VIII, 292 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Artificial intelligence / Data processing
|
| 653 |
|
|
|a Computer graphics
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Computer Graphics
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Computational Mathematics and Numerical Analysis
|
| 653 |
|
|
|a Mathematics / Data processing
|
| 653 |
|
|
|a Geometry
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Data Science
|
| 700 |
1 |
|
|a Kano, Mikio
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b11261
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b11261?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 516
|