Discrete and Computational Geometry : Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers - Livro de bolso
2000, ISBN: 3540671811
[EAN: 9783540671817], Neubuch, [PU: Springer Berlin Heidelberg], GEOMETRIE; RAUMLEHRE; GRAPH - GRAPHENTHEORIE; COMPUTATIONALGEOMETRY; GRAPH; ALGORITHMICGEOMETRY; COMBINATORIALGEOMETRY; CO… mais…
AbeBooks.de AHA-BUCH GmbH, Einbeck, Germany [51283250] [Rating: 5 (von 5)] NEW BOOK. Custos de envio:Versandkostenfrei. (EUR 0.00) Details... |
Discrete and Computational Geometry Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers - novo libro
2000, ISBN: 3540671811
2000 Kartoniert / Broschiert Geometrie, Raumlehre, Graph - Graphentheorie, Diskrete Mathematik, Algorithmen und Datenstrukturen, Grafikprogrammierung, Theoretische Informatik, computati… mais…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Custos de envio:Versandkostenfrei innerhalb der BRD. (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, Engli… mais…
Hugendubel.de Custos de envio: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… mais…
Hugendubel.de Custos de envio: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 ab 74.99 € als Taschenbuch: Japanese Conference JCDCG'98 Tokyo Japan December 9-12 1998 Revised Papers. Auflage 2000. Aus dem Bereich: Bücher, Ratgeber… mais…
Hugendubel.de Custos de envio: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 - Livro de bolso
2000, ISBN: 3540671811
[EAN: 9783540671817], Neubuch, [PU: Springer Berlin Heidelberg], GEOMETRIE; RAUMLEHRE; GRAPH - GRAPHENTHEORIE; COMPUTATIONALGEOMETRY; GRAPH; ALGORITHMICGEOMETRY; COMBINATORIALGEOMETRY; CO… mais…
Akiyama, Jin (Herausgeber); Urabe, Masatsugu (Herausgeber); Kano, Mikio (Herausgeber):
Discrete and Computational Geometry Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers - novo libro2000, ISBN: 3540671811
2000 Kartoniert / Broschiert Geometrie, Raumlehre, Graph - Graphentheorie, Diskrete Mathematik, Algorithmen und Datenstrukturen, Grafikprogrammierung, Theoretische Informatik, computati… mais…
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… mais…
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… mais…
2000, ISBN: 9783540671817
Discrete and Computational Geometry ab 74.99 € als Taschenbuch: Japanese Conference JCDCG'98 Tokyo Japan December 9-12 1998 Revised Papers. Auflage 2000. Aus dem Bereich: Bücher, Ratgeber… mais…
Dados bibliográficos do melhor livro correspondente
Autor: | |
Título: | |
Número ISBN: |
Dados detalhados do livro - Discrete and Computational Geometry
EAN (ISBN-13): 9783540671817
ISBN (ISBN-10): 3540671811
Livro de capa dura
Livro de bolso
Ano de publicação: 2007
Editor/Editora: Springer Berlin Heidelberg
348 Páginas
Peso: 0,526 kg
Língua: eng/Englisch
Livro na base de dados desde 2007-05-21T11:03:01+01:00 (Lisbon)
Página de detalhes modificada pela última vez em 2024-01-08T13:55:49+00:00 (Lisbon)
Número ISBN/EAN: 3540671811
Número ISBN - Ortografia alternativa:
3-540-67181-1, 978-3-540-67181-7
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: akiyama, tokyo, masats, jin
Título do livro: discrete computational geometry, japanese paper, vis vis japan tokyo, japanese papers, tokyo certain, 1998
Dados da editora
Autor: Jin Akiyama; Mikio Kano; Masatsugu Urabe
Título: Lecture Notes in Computer Science; Discrete and Computational Geometry - Japanese Conference, JCDCG'98 Tokyo, Japan, December 9-12, 1998 Revised Papers
Editora: Springer; Springer Berlin
340 Páginas
Ano de publicação: 2000-02-16
Berlin; Heidelberg; DE
Língua: Inglês
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
Outros livros adicionais, que poderiam ser muito similares com este livro:
Último livro semelhante:
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.)
< Para arquivar...