Discrete and computational geometry : Japanese conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002 : revised papers
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
2866 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Discrete and computational geometry, Japanese conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, revised papers, Jin Akiyama, Mikio Kano (eds.), Berlin, Springer, 2003, 1 vol. (VIII-283 p.), Lecture notes in computer science, 3-540-20776-7 • Discrete and Computational Geometry, Texte imprimé, 9783662212882 |
Table des matières:
- 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.