2016, ISBN: 9783540207764
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - Since it was rst organized in 1997, the Japan Conference on Discrete and C- putational Geometry (JCDCG) continues to attrac… Mehr…
booklooker.de |
2002, ISBN: 9783540207764
Since it was ?rst organized in 1997, the Japan Conference on Discrete and C- putational Geometry (JCDCG) continues to attract an international audience. The ?rst ?ve conferences of the se… Mehr…
Indigo.ca new in stock. Versandkosten:zzgl. Versandkosten. Details... |
Discrete and Computational Geometry Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers - neues Buch
2003, ISBN: 3540207767
2003 Kartoniert / Broschiert Informatik, Diskrete Mathematik, Geometrie, Algorithmen und Datenstrukturen, Grafikprogrammierung, Datenbanken, Mathematik für Informatiker, Maxima; Triangu… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
2003, ISBN: 9783540207764
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Universal Measuring Devic… Mehr…
booklooker.de |
2003, ISBN: 9783540207764
Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, Buch, Softcover, 2003, [PU: Springer Berlin], Springer Berlin, 2003
lehmanns.de Versandkosten:Versand in 10-14 Tagen. (EUR 0.00) Details... |
2016, ISBN: 9783540207764
[ED: Taschenbuch], [PU: Springer Berlin Heidelberg], Neuware - Since it was rst organized in 1997, the Japan Conference on Discrete and C- putational Geometry (JCDCG) continues to attrac… Mehr…
2002, ISBN: 9783540207764
Since it was ?rst organized in 1997, the Japan Conference on Discrete and C- putational Geometry (JCDCG) continues to attract an international audience. The ?rst ?ve conferences of the se… Mehr…
Discrete and Computational Geometry Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers - neues Buch
2003
ISBN: 3540207767
2003 Kartoniert / Broschiert Informatik, Diskrete Mathematik, Geometrie, Algorithmen und Datenstrukturen, Grafikprogrammierung, Datenbanken, Mathematik für Informatiker, Maxima; Triangu… Mehr…
2003, ISBN: 9783540207764
Taschenbuch
[ED: Kartoniert / Broschiert], [PU: Springer Berlin Heidelberg], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Universal Measuring Devic… Mehr…
2003, ISBN: 9783540207764
Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, Buch, Softcover, 2003, [PU: Springer Berlin], Springer Berlin, 2003
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Discrete and Computational Geometry
EAN (ISBN-13): 9783540207764
ISBN (ISBN-10): 3540207767
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2003
Herausgeber: Springer Berlin
300 Seiten
Gewicht: 0,456 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-05-21T12:03:01+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-02-09T16:24:26+01:00 (Berlin)
ISBN/EAN: 9783540207764
ISBN - alternative Schreibweisen:
3-540-20776-7, 978-3-540-20776-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: akiyama, jin, frederickson, joseph rourke
Titel des Buches: japan computer, discrete computational geometry, lecture notes computer science, vis vis japan tokyo, tokyo certain, japan japanese, artificial japan, 2002
Daten vom Verlag:
Autor/in: Jin Akiyama; Mikio Kano
Titel: Lecture Notes in Computer Science; Discrete and Computational Geometry - Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers
Verlag: Springer; Springer Berlin
292 Seiten
Erscheinungsjahr: 2003-12-16
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
VIII, 292 p.
BC; Hardcover, Softcover / Mathematik/Geometrie; Geometrie; Verstehen; Informatik; Mathematik; Maxima; Triangulation; algorithm; algorithmic geometry; algorithms; combinatorial mathematics; complexity; computational geometry; convex geometry; data structure; data structures; discrete geometry; geometric algorithms; graph computations; lattice computations; algorithm analysis and problem complexity; Geometry; Computer Graphics; Data Science; Algorithms; Discrete Mathematics in Computer Science; Computational Mathematics and Numerical Analysis; Grafikprogrammierung; Datenbanken; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; Numerische Mathematik; EA
Universal Measuring Devices with Rectangular Base.- Maximin Distance for n Points in a Unit Square or a Unit Circle.- Congruent Dudeney Dissections of Polygons.- Playing with Triangulations.- The Foldings of a Square to Convex Polyhedra.- On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities.- On Partitioning a Cake.- Constrained Equitable 3-Cuttings.- On the Minimum Perimeter Triangle Enclosing a Convex Polygon.- Succinct Data Structures for Approximating Convex Functions with Applications.- Efficient Algorithms for Constructing a Pyramid from a Terrain.- On the Face Lattice of the Metric Polytope.- Partitioning a Planar Point Set into Empty Convex Polygons.- Relaxed Scheduling in Dynamic Skin Triangulation.- A Note on Point Subsets with a Specified Number of Interior Points.- Piano-Hinged Dissections: Now Let’s Fold!.- The Convex Hull for Random Lines in the Plane.- Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon.- On Reconfiguring Radial Trees.- Viewing Cube and Its Visual Angles.- Observing an Angle from Various Viewpoints.- The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere.- Maximal Number of Edges in Geometric Graphs without Convex Polygons.- Relaxing Planarity for Topological Graphs.- On the Size of a Radial Set.- Tight Bounds for Visibility Matching of f-Equal Width Objects.- Long Paths through Specified Vertices in 3-Connected Graphs.- On the Number of Intersections of Three Monochromatic Trees in the Plane.- Open Problems in Geometric Methods for Instance-Based Learning.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)
- 9780387873633 Twentieth Anniversary Volume: Discrete & Computational Geometry (Richard Pollack; Jacob E. Goodman; János Pach; Janos Pach; Richard Pollack; Jacob E. Goodman.)
< zum Archiv...