Discrete and Computational Geometry [electronic resource] : Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers /
Material type: TextSeries: Lecture Notes in Computer Science ; 2866Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003Edition: 1st ed. 2003Description: VIII, 292 p. online resourceContent type:- text
- computer
- online resource
- 9783540444008
- Geometry
- Computer graphics
- Artificial intelligence -- Data processing
- Algorithms
- Computer science -- Mathematics
- Discrete mathematics
- Mathematics -- Data processing
- Geometry
- Computer Graphics
- Data Science
- Algorithms
- Discrete Mathematics in Computer Science
- Computational Mathematics and Numerical Analysis
- 516 23
- QA440-699
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.
There are no comments on this title.