Amazon cover image
Image from Amazon.com

Discrete and Computational Geometry.

Material type: TextTextSeries: Serienbezeichnung | Lecture notes in computer sciencePublication details: Springer Berlin / Heidelberg, 2003. Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540444008; 3540444009Subject(s): Computer science | Data structures (Computer science) | Computer software | Computational complexity | Computer graphics | Computer science -- Mathematics | Discrete groups | Computational complexity | Computer graphics | Computer science | Computer science -- Mathematics | Computer software | Data structures (Computer science) | Discrete groupsGenre/Form: Electronic books. Additional physical formats: Print version:: Discrete and Computational Geometry : Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002. Revised Papers.DDC classification: 006.6 LOC classification: T385Online resources: Click here to access online
Contents:
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.
Summary: This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2002, held in Tokyo, Japan, in December 2002. The 29 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in discrete algorithmic geometry are addressed.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

This book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2002, held in Tokyo, Japan, in December 2002. The 29 revised full papers presented were carefully selected during two rounds of reviewing and improvement. All current issues in discrete algorithmic geometry are addressed.

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.

Powered by Koha