- 5 Ergebnisse
Kleinster Preis: € 53,49, größter Preis: € 80,24, Mittelwert: € 66,60
1
Discrete and Computational Geometry : Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers - Jin Akiyama
Bestellen
bei ZVAB.com
€ 59,51
Versand: € 0,001
Bestellengesponserter Link
Jin Akiyama:

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

2001, ISBN: 3540423060

[EAN: 9783540423065], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; ANALYSE / DATENANALYSE; DISKRET (MATHEMATISCH); GEOMETRIE; RAUMLEHRE; ALGORITHMICGEOMETRY; APPROXI… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
2
Discrete and Computational Geometry : Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers - Jin Akiyama
Bestellen
bei AbeBooks.de
€ 59,51
Versand: € 0,001
Bestellengesponserter Link

Jin Akiyama:

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

2001, ISBN: 3540423060

[EAN: 9783540423065], Neubuch, [PU: Springer Berlin Heidelberg], ALGORITHMUS; ANALYSE / DATENANALYSE; DISKRET (MATHEMATISCH); GEOMETRIE; RAUMLEHRE; ALGORITHMICGEOMETRY; APPROXIMATION; COM… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)]
3
Discrete and Computational Geometry - Jin Akiyama
Bestellen
bei AbeBooks.de
€ 80,24
Versand: € 0,001
Bestellengesponserter Link
Jin Akiyama:
Discrete and Computational Geometry - Taschenbuch

2001

ISBN: 3540423060

[EAN: 9783540423065], Neubuch, [PU: Springer Berlin Heidelberg Jun 2001], ALGORITHMUS; ANALYSE / DATENANALYSE; DISKRET (MATHEMATISCH); GEOMETRIE; RAUMLEHRE; ALGORITHMICGEOMETRY; APPROXIMA… Mehr…

NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 4 (von 5)]
4
Discrete and Computational Geometry - Jin Akiyama
Bestellen
bei booklooker.de
€ 80,24
Versand: € 0,001
Bestellengesponserter Link
Jin Akiyama:
Discrete and Computational Geometry - Taschenbuch

2020, ISBN: 9783540423065

[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - TheJapanConferenceonDiscreteandComputationalGeometry(JCDCG)has beenheldannuallysince1997. Oneofthegoalsofthisconferenceserie… Mehr…

Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) BuchWeltWeit Inh. Ludwig Meier e.K.
5
Discrete and Computational Geometry
Bestellen
bei Hugendubel.de
€ 53,49
Versand: € 7,501
Bestellengesponserter Link
Discrete and Computational Geometry - Taschenbuch

2001, ISBN: 9783540423065

*Discrete and Computational Geometry* - Japanese Conference JCDCG 2000 Tokyo Japan November 22-25 2000. Revised Papers. Auflage 2001 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, E… Mehr…

Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 7.50)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch
Discrete and Computational Geometry

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

Detailangaben zum Buch - Discrete and Computational Geometry


EAN (ISBN-13): 9783540423065
ISBN (ISBN-10): 3540423060
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2001
Herausgeber: Springer Berlin Heidelberg
400 Seiten
Gewicht: 0,602 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-05-21T12:03:01+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-04-21T17:48:24+02:00 (Berlin)
ISBN/EAN: 3540423060

ISBN - alternative Schreibweisen:
3-540-42306-0, 978-3-540-42306-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: akiyama, masats, jin, watanabe, taniguchi, speckmann, nakamura, rappaport, yokoyama, halperin, frederickson, kirkpatrick
Titel des Buches: japan computer, discrete computational geometry, japanese paper, vis vis japan tokyo, tokyo certain, japan 2000, november


Daten vom Verlag:

Autor/in: Jin Akiyama; Mikio Kano; Masatsugu Urabe
Titel: Lecture Notes in Computer Science; Discrete and Computational Geometry - Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000. Revised Papers
Verlag: Springer; Springer Berlin
388 Seiten
Erscheinungsjahr: 2001-06-20
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 388 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmic Geometry; Approximation; Combinatorial Mathematics; Computational Geometry; Convex Jets; Discrete Geometry; Discrete Mathematics; Geometric Algorithms; Graph Computation; Optimization; Triangulation; Triangulations; algorithms; complexity; sets; algorithm analysis and problem complexity; Theory of Computation; Geometry; Computer and Information Systems Applications; Algorithms; Discrete Mathematics in Computer Science; Computer Graphics; Geometrie; Angewandte Informatik; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Grafikprogrammierung; EA

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.
Includes supplementary material: sn.pub/extras

< zum Archiv...