Discrete and computational geometry : Japanese conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000 : revised papers
Saved in:
| Corporate Author: | |
|---|---|
| Other Authors: | , , |
| Format: | Livre numérique |
| Language: | Anglais |
| Published: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
2098 |
| Subjects: | |
| Online Access: | 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 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 |
| LEADER | 04661nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 970030 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15518332X | ||
| 020 | |a 9783540477389 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 516.13 | ||
| 111 | 2 | |a Japan Conference on Discrete and Computational Geometry |d (2000 |c :Tokyo). | |
| 245 | 1 | 0 | |a Discrete and computational geometry : |b Japanese conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000 : revised papers |c [edited by] Jin Akiyama, Mikio Kano, Masatsugu Urabe. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2098 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Géométrie algorithmique | ||
| 650 | |a Géométrie |x Informatique | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Géométrie combinatoire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Akiyama, Jin, |d 1946- |4 pbd | |
| 700 | 1 | |a Kano, Mikio, |d 1949- |4 pbd | |
| 700 | 1 | |a Urabe, Masatsugu, |d 1960- |4 pbd | |
| 776 | 0 | |0 058089411 |t Discrete and computational geometry |o Japanese conference, JCDCG 2000, Tokyo, Japan, November 22-25, 2000 |o revised papers |f Jim Akiyama, Mikio Kano, Masatsugu Urabe, eds |d 2001 |c New York (N.Y.) |n Springer |p 1 vol. (XI-380 p.) |s Lecture notes in computer science |z 3-540-42306-0 | |
| 776 | 0 | |t Discrete and Computational Geometry |b Texte imprimé |z 9783662196182 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-47738-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-JM1JDVZG-X |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750667567 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-47738-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754016684 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-47738-1 |z Accès INSA CVL | |
| 997 | |0 970030 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||