Discrete and Computational Geometry : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers - Taschenbuch
2000, ISBN: 3540671811
[EAN: 9783540671817], Neubuch, [PU: Springer Berlin Heidelberg], GEOMETRIE; RAUMLEHRE; GRAPH - GRAPHENTHEORIE; COMPUTATIONALGEOMETRY; GRAPH; ALGORITHMICGEOMETRY; COMBINATORIALGEOMETRY; CO… Mehr…
AbeBooks.de AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
Discrete and Computational Geometry : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers - Taschenbuch
2000, ISBN: 3540671811
[EAN: 9783540671817], Neubuch, [PU: Springer Berlin Heidelberg], GEOMETRIE; RAUMLEHRE; GRAPH - GRAPHENTHEORIE; COMPUTATIONALGEOMETRY; GRAPH; ALGORITHMICGEOMETRY; COMBINATORIALGEOMETRY; CO… Mehr…
AbeBooks.de AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details... |
ISBN: 9783540671817
This volume consists of those papers presented at the Japan Conference on Discrete and Computational Geometry ’98. The conference was held 9-12 - cember 1998 at Tokai University in … Mehr…
BarnesandNoble.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
2000, ISBN: 9783540671817
*Discrete and Computational Geometry* - Japanese Conference JCDCG'98 Tokyo Japan December 9-12 1998 Revised Papers. Auflage 2000 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Engli… Mehr…
Hugendubel.de Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
2000, ISBN: 9783540671817
*Discrete and Computational Geometry* - Japanese Conference JCDCG'98 Tokyo Japan December 9-12 1998 Revised Papers. Auflage 2000 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Ratge… Mehr…
Hugendubel.de Versandkosten:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., DE. (EUR 0.00) Details... |
Discrete and Computational Geometry : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers - Taschenbuch
2000, ISBN: 3540671811
[EAN: 9783540671817], Neubuch, [PU: Springer Berlin Heidelberg], GEOMETRIE; RAUMLEHRE; GRAPH - GRAPHENTHEORIE; COMPUTATIONALGEOMETRY; GRAPH; ALGORITHMICGEOMETRY; COMBINATORIALGEOMETRY; CO… Mehr…
Jin Akiyama:
Discrete and Computational Geometry : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers - Taschenbuch2000, ISBN: 3540671811
[EAN: 9783540671817], Neubuch, [PU: Springer Berlin Heidelberg], GEOMETRIE; RAUMLEHRE; GRAPH - GRAPHENTHEORIE; COMPUTATIONALGEOMETRY; GRAPH; ALGORITHMICGEOMETRY; COMBINATORIALGEOMETRY; CO… Mehr…
ISBN: 9783540671817
This volume consists of those papers presented at the Japan Conference on Discrete and Computational Geometry ’98. The conference was held 9-12 - cember 1998 at Tokai University in … Mehr…
2000, ISBN: 9783540671817
*Discrete and Computational Geometry* - Japanese Conference JCDCG'98 Tokyo Japan December 9-12 1998 Revised Papers. Auflage 2000 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Engli… Mehr…
2000, ISBN: 9783540671817
*Discrete and Computational Geometry* - Japanese Conference JCDCG'98 Tokyo Japan December 9-12 1998 Revised Papers. Auflage 2000 / Taschenbuch für 53.49 € / Aus dem Bereich: Bücher, Ratge… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Discrete and Computational Geometry: Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers Jin Akiyama Editor
EAN (ISBN-13): 9783540671817
ISBN (ISBN-10): 3540671811
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2007
Herausgeber: Springer Berlin Heidelberg Core >1 >T
348 Seiten
Gewicht: 0,526 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-05-21T12:03:01+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-03-21T16:25:33+01:00 (Berlin)
ISBN/EAN: 9783540671817
ISBN - alternative Schreibweisen:
3-540-67181-1, 978-3-540-67181-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: akiyama, tokyo, masats, jin
Titel des Buches: discrete computational geometry, japanese paper, vis vis japan tokyo, japanese papers, tokyo certain, 1998
Daten vom Verlag:
Autor/in: Jin Akiyama; Mikio Kano; Masatsugu Urabe
Titel: Lecture Notes in Computer Science; Discrete and Computational Geometry - Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers
Verlag: Springer; Springer Berlin
340 Seiten
Erscheinungsjahr: 2000-02-16
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 340 p.
BC; Hardcover, Softcover / Mathematik/Geometrie; Geometrie; Verstehen; Computational geometry; Graph; algorithmic geometry; combinatorial geometry; convex sets; discrete geometry; graph theory; algorithm analysis and problem complexity; combinatorics; Geometry; Theory of Computation; Computer Graphics; Algorithms; Discrete Mathematics in Computer Science; Discrete Mathematics; Theoretische Informatik; Grafikprogrammierung; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; EA
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.Includes supplementary material: sn.pub/extras
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
2900691145531 Discrete and Computational Geometry (Satyan L. Devadoss)
- 2900691145531 Discrete and Computational Geometry (Satyan L. Devadoss)
- 2370003318081 Discrete and Computational Geometry (Devadoss, Satyan L.;O´Rourke, Joseph)
- 9780387874234 Twentieth Anniversary Volume: Discrete & Computational Geometry
- 9780387873626 Twentieth Anniversary Volume: Discrete & Computational Geometry (Jacob E. Goodman)
- 9783540207764 Discrete and Computational Geometry (Akiyama, Jin Kano, Mikio)
< zum Archiv...