Discrete and computational geometry : Japanese conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000 : revised papers
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
2098 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 2000, Tokyo, Japan, November 22-25, 2000, revised papers, Jim Akiyama, Mikio Kano, Masatsugu Urabe, eds, 2001, New York (N.Y.), Springer, 1 vol. (XI-380 p.), Lecture notes in computer science, 3-540-42306-0 • Discrete and Computational Geometry, Texte imprimé, 9783662196182 |
Tabla de Contenidos:
- Papers
- Dudeney Dissections of Polygons and Polyhedrons A Survey
- Universal Measuring Devices Without Gradations
- A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square
- Sequentially Divisible Dissections of Simple Polygons
- Packing Convex Polygons into Rectangular Boxes
- On the Number of Views of Polyhedral Scenes
- Problems and Results around the Erdös-Szekeres Convex Polygon Theorem
- On Finding Maximum-Cardinality Symmetric Subsets
- Folding and Unfolding Linkages, Paper, and Polyhedra
- On the Skeleton of the Metric Polytope
- Geometric Dissections that Swing and Twist
- On Convex Decompositions of Points
- Volume Queries in Polyhedra
- Sum of Edge Lengths of a Graph Drawn on a Convex Polygon
- On double bound graphs with respect to graph operations
- Generalized Balanced Partitions of Two Sets of Points in the Plane
- On Paths in a Complete Bipartite Geometric Graph
- Approximating Uniform Triangular Meshes for Spheres
- The construction of Delaunay diagrams by lob reduction
- Geometric Transformation in Plane Triangulations
- Separation Sensitive Kinetic Separation Structures for Convex Polygons
- On Acute Triangulations of Quadrilaterals
- Intersecting Red and Blue Line Segments in Optimal Time and Precision
- Tight Error Bound of Goemetric Problems on Convex Objects with Imprecise Coordinates
- Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs
- Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces
- An Extension of Cauchy s Arm Lemma with Application to Curve Development
- On the complexity of the union of geometric objects
- Structure Theorems for Systems of Segments
- 3 Dimensional Single Active Layer Routing
- Nonregular triangulations, view graphs oftriangulations, and linear programming duality
- Efficient Algorithms for Searching a Polygonal Room with a Door
- A New Structure of Cylinder Packing
- Efficient algorithms for the minimum diameter bridge problem
- Illuminating Both Sides of Line Segments.