Discrete and Computational Geometry Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Akiyama, Jin (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Kano, Mikio (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Urabe, Masatsugu (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2098
• Θέματα: 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.

Πίνακας περιεχομένων:

• 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.