Skip to main content

Picture 1 of 7

Stock photo
Stock photo
Discrete and Computational Geometry Japanese Conference, JCDCG 2000 Revised - Picture 1 of 7
Discrete and Computational Geometry Japanese Conference, JCDCG 2000 Revised - Picture 2 of 7
Discrete and Computational Geometry Japanese Conference, JCDCG 2000 Revised - Picture 3 of 7
Discrete and Computational Geometry Japanese Conference, JCDCG 2000 Revised - Picture 4 of 7
Discrete and Computational Geometry Japanese Conference, JCDCG 2000 Revised - Picture 5 of 7
Discrete and Computational Geometry Japanese Conference, JCDCG 2000 Revised - Picture 6 of 7
Discrete and Computational Geometry Japanese Conference, JCDCG 2000 Revised - Picture 7 of 7

Lecture Notes in Computer Science Ser.: Discrete and Computational Geometry : Japanese Conference, JCDCG 2000, Tokyo, Japan, November 2000 - Revised Papers by Mikio Kano (2001, Trade Paperback)

aleks_the_great (85)
100% positive feedback
Price:
US $45.78
(inclusive of GST)
ApproximatelyS$ 58.84
+ $56.81 shipping
Estimated delivery Wed, 30 Jul - Fri, 8 Aug
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Very Good

About this product

Product Identifiers

PublisherSpringer Berlin / Heidelberg
ISBN-103540423060
ISBN-139783540423065
eBay Product ID (ePID)1975887

Product Key Features

Number of PagesXii, 388 Pages
LanguageEnglish
Publication NameDiscrete and Computational Geometry : Japanese Conference, JCDCG 2000, Tokyo, Japan, November 2000 - Revised Papers
Publication Year2001
SubjectGeometry / General, Computer Science, Enterprise Applications / General
TypeTextbook
Subject AreaMathematics, Computers
AuthorMikio Kano
SeriesLecture Notes in Computer Science Ser.
FormatTrade Paperback

Dimensions

Item Weight43.4 Oz
Item Length9.3 in
Item Width6.1 in

Additional Product Features

Intended AudienceScholarly & Professional
LCCN2001-042885
Dewey Edition21
Series Volume Number2098
Number of Volumes1 vol.
IllustratedYes
Dewey Decimal516/.13
Table Of ContentPapers.- 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.
SynopsisThis book constitutes the thoroughly refereed post-proceedings of the Japanese Conference on Discrete Computational Geometry, JCDCG 2001, held in Tokyo, Japan in November 2001. The 35 revised papers presented were carefully reviewed and selected. Among the topics covered are polygons and polyhedrons, divissible dissections, convex polygon packings, symmetric subsets, convex decompositions, graph drawing, graph computations, point sets, approximation, Delauny diagrams, triangulations, chromatic numbers, complexity, layer routing, efficient algorithms, and illumination problems.
LC Classification NumberQA75.5-76.95
No ratings or reviews yet
Be the first to write a review

You may also like