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
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
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
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Edizione: | 1st ed. 2001. |
| Descrizione fisica: | 1 online resource (XII, 388 p.) |
| Disciplina: | 516.13 |
| 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 | |
| Persona (resp. second.): | AkiyamaJin |
| KanoMikio | |
| UrabeMasatsugu | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di bibliografia: | Includes bibliographical references at the end of each chapters and index. |
| 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. |
| Titolo autorizzato: | Discrete and computational geometry |
| ISBN: | 3-540-47738-1 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996465817503316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 2098