Artículos relacionados a Algorithms in Combinatorial Geometry: 10 (Monographs...
Algorithms in Combinatorial Geometry: 10 (Monographs in Theoretical Computer Science. An EATCS Series) - Tapa blanda
Sinopsis
Book by Edelsbrunner Herbert
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2011
- ISBN 10 3642648738
- ISBN 13 9783642648731
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas444
Comprar nuevo
Ver este artículo
EUR 96,29
EUR 23,00 gastos de envío desde Alemania a Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Algorithms in Combinatorial Geometry: 10 (Monographs...
Imagen del vendedor
Algorithms in Combinatorial Geometry
Publicado por
Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10: 3642648738
ISBN 13: 9783642648731
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783642648731
Gastos de envío:
EUR 23,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 2 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783642648731_new
Gastos de envío:
EUR 14,17
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLING22Oct2817100464616
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Algorithms in Combinatorial Geometry
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648738
ISBN 13: 9783642648731
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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 ref. del artículo: 9783642648731
Gastos de envío:
EUR 31,33
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen del vendedor
Algorithms in Combinatorial Geometry
Publicado por
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648738
ISBN 13: 9783642648731
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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 ref. del artículo: 5067081
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles