Articles liés à Algorithms in Combinatorial Geometry

Algorithms in Combinatorial Geometry - Couverture souple

 
9783642648731: Algorithms in Combinatorial Geometry

Synopsis

Algorithms in Combinatorial Geometry This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

  • ÉditeurSpringer
  • Date d'édition2011
  • ISBN 10 3642648738
  • ISBN 13 9783642648731
  • ReliureBroché
  • Langueanglais
  • Nombre de pages444

Acheter neuf

Afficher cet article
EUR 96,29

Autre devise

EUR 23 expédition depuis Allemagne vers Etats-Unis

Destinations, frais et délais

Autres éditions populaires du même titre

Résultats de recherche pour Algorithms in Combinatorial Geometry

Image fournie par le vendeur

Herbert Edelsbrunner
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Neuf Taschenbuch
impression à la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field. 444 pp. Englisch. N° de réf. du vendeur 9783642648731

Contacter le vendeur

Acheter neuf

EUR 96,29
Autre devise
Frais de port : EUR 23
De Allemagne vers Etats-Unis
Destinations, frais et délais

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Edelsbrunner, Herbert
Edité par Springer, 2011
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. In. N° de réf. du vendeur ria9783642648731_new

Contacter le vendeur

Acheter neuf

EUR 105,94
Autre devise
Frais de port : EUR 14,13
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Edelsbrunner, Herbert
Edité par Springer, 2011
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Neuf Couverture souple

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. N° de réf. du vendeur ABLING22Oct2817100464616

Contacter le vendeur

Acheter neuf

EUR 120
Autre devise
Frais de port : EUR 3,55
Vers Etats-Unis
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Herbert Edelsbrunner
Edité par Springer Berlin Heidelberg, 2011
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field. N° de réf. du vendeur 9783642648731

Contacter le vendeur

Acheter neuf

EUR 96,29
Autre devise
Frais de port : EUR 31,33
De Allemagne vers Etats-Unis
Destinations, frais et délais

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Herbert Edelsbrunner
Edité par Springer Berlin Heidelberg, 2011
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Neuf Couverture souple
impression à la demande

Vendeur : moluna, Greven, Allemagne

Évaluation du vendeur 5 sur 5 étoiles Evaluation 5 étoiles, En savoir plus sur les évaluations des vendeurs

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of co. N° de réf. du vendeur 5067081

Contacter le vendeur

Acheter neuf

EUR 81,44
Autre devise
Frais de port : EUR 48,99
De Allemagne vers Etats-Unis
Destinations, frais et délais

Quantité disponible : Plus de 20 disponibles

Ajouter au panier