Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series)

Edelsbrunner, Herbert

ISBN 10: 3642648738 ISBN 13: 9783642648731
Edité par Springer, 2011
Neuf(s) 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

Vendeur AbeBooks depuis 25 mars 2015


A propos de cet article

Description :

In. N° de réf. du vendeur ria9783642648731_new

Signaler cet article

Synopsis :

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.

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.

Détails bibliographiques

Titre : Algorithms in Combinatorial Geometry (...
Éditeur : Springer
Date d'édition : 2011
Reliure : Couverture souple
Etat : New

Meilleurs résultats de recherche sur AbeBooks

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 4 sur 5 étoiles Evaluation 4 é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
EUR 48,99 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

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

Vendeur : preigu, Osnabrück, Allemagne

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

Taschenbuch. Etat : Neu. Algorithms in Combinatorial Geometry | Herbert Edelsbrunner | Taschenbuch | xv | Englisch | 2011 | Springer | EAN 9783642648731 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. N° de réf. du vendeur 106367550

Contacter le vendeur

Acheter neuf

EUR 84,60
EUR 70 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 5 disponible(s)

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 93,60
EUR 3,40 shipping
Expédition nationale : Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

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

Vendeur : GreatBookPrices, Columbia, MD, 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 18724410-n

Contacter le vendeur

Acheter neuf

EUR 94,78
EUR 2,25 shipping
Expédition nationale : Etats-Unis

Quantité disponible : 15 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 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
EUR 63,34 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Herbert Edelsbrunner
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

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

Taschenbuch. Etat : Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 444 pp. Englisch. N° de réf. du vendeur 9783642648731

Contacter le vendeur

Acheter neuf

EUR 96,29
EUR 60 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 2 disponible(s)

Ajouter au panier

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
EUR 23 shipping
Expédition depuis Allemagne vers Etats-Unis

Quantité disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Edelsbrunner, Herbert
Edité par Springer, 2011
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Ancien ou d'occasion Couverture souple

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

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

Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 18724410

Contacter le vendeur

Acheter D'occasion

EUR 112,05
EUR 2,25 shipping
Expédition nationale : Etats-Unis

Quantité disponible : 15 disponible(s)

Ajouter au panier

Image fournie par le vendeur

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

Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni

É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 18724410-n

Contacter le vendeur

Acheter neuf

EUR 112,38
EUR 17,12 shipping
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Edelsbrunner, Herbert
Edité par Springer, 2011
ISBN 10 : 3642648738 ISBN 13 : 9783642648731
Ancien ou d'occasion Couverture souple

Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni

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

Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 18724410

Contacter le vendeur

Acheter D'occasion

EUR 113,34
EUR 17,12 shipping
Expédition depuis Royaume-Uni vers Etats-Unis

Quantité disponible : Plus de 20 disponibles

Ajouter au panier