Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe
| Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 388 p.) |
| Disciplina | 516.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Geometry Application software Algorithms Computer science—Mathematics Computer graphics Theory of Computation Computer Applications Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-47738-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 of triangulations, 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. |
| Record Nr. | UNISA-996465817503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete and Computational Geometry : Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe
| Discrete and Computational Geometry : Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 388 p.) |
| Disciplina | 516.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Geometry Application software Algorithms Computer science—Mathematics Computer graphics Theory of Computation Computer Applications Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-540-47738-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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 of triangulations, 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. |
| Record Nr. | UNINA-9910143594803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe
| Discrete and Computational Geometry [[electronic resource] ] : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 340 p.) |
| Disciplina | 516/.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Geometry
Computers Computer graphics Algorithms Computer science—Mathematics Combinatorics Theory of Computation Computer Graphics Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-540-46515-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Papers -- Radial Perfect Partitions of Convex Sets in the Plane -- Dudeney Dissection of Polygons -- Effective Use of Geometric Properties for Clustering -- Living with lrs -- On the Existente of a Point Subset with 4 or 5 Interior Points -- Planar Drawing Algorithms of Survivable Telecommunication Networks -- Polygon Cutting: Revisited -- Algorithms for Packing Two Circles in a Convex Polygon -- Folding and Cutting Paper -- An Interpolant Based on Line Segment Voronoi Diagrams -- 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces -- NP-Completeness of Stage Illumination Problems -- On the Maximum Degree of Bipartite Embeddings of Trees in the Plane -- Efficient Regular Polygon Dissections -- On Soddy’s Hexlet and a Linked 4-Pair -- Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs -- Visibility of Disks on the Lattice Points -- Convex Hull Problem with Imprecise Input -- One-Dimensional Tilings with Congruent Copies of a 3-Point Set -- Polygonal Approximations for Curved Problems: An Application to Arrangements -- Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms -- Folding and Unfolding in Computational Geometry -- Crossing Numbers -- A Note on the Existente of Plane Spanning Trees of Geometrie Graphs -- Embeddings of Equilateral Polygons in Unit Lattices -- Order-k Voronoi Diagrams, k-Sections, and k-Sets -- ”Impossible Objects” Are Not Necessarily Impossible – Mathematical Study on Optical Illusion – -- An Efficient Solution to the Corridor Search Problem. |
| Record Nr. | UNISA-996465585203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Discrete and Computational Geometry : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe
| Discrete and Computational Geometry : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers / / edited by Jin Akiyama, Mikio Kano, Masatsugu Urabe |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (VIII, 340 p.) |
| Disciplina | 516/.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Geometry
Computers Computer graphics Algorithms Computer science—Mathematics Combinatorics Theory of Computation Computer Graphics Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
| ISBN | 3-540-46515-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Papers -- Radial Perfect Partitions of Convex Sets in the Plane -- Dudeney Dissection of Polygons -- Effective Use of Geometric Properties for Clustering -- Living with lrs -- On the Existente of a Point Subset with 4 or 5 Interior Points -- Planar Drawing Algorithms of Survivable Telecommunication Networks -- Polygon Cutting: Revisited -- Algorithms for Packing Two Circles in a Convex Polygon -- Folding and Cutting Paper -- An Interpolant Based on Line Segment Voronoi Diagrams -- 2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces -- NP-Completeness of Stage Illumination Problems -- On the Maximum Degree of Bipartite Embeddings of Trees in the Plane -- Efficient Regular Polygon Dissections -- On Soddy’s Hexlet and a Linked 4-Pair -- Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs -- Visibility of Disks on the Lattice Points -- Convex Hull Problem with Imprecise Input -- One-Dimensional Tilings with Congruent Copies of a 3-Point Set -- Polygonal Approximations for Curved Problems: An Application to Arrangements -- Grouping and Querying: A Paradigm to Get Output-Sensitive Algorithms -- Folding and Unfolding in Computational Geometry -- Crossing Numbers -- A Note on the Existente of Plane Spanning Trees of Geometrie Graphs -- Embeddings of Equilateral Polygons in Unit Lattices -- Order-k Voronoi Diagrams, k-Sections, and k-Sets -- ”Impossible Objects” Are Not Necessarily Impossible – Mathematical Study on Optical Illusion – -- An Efficient Solution to the Corridor Search Problem. |
| Record Nr. | UNINA-9910143638503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||