Artículos relacionados a Algorithms in Combinatorial Geometry: 10 (Monographs...
Algorithms in Combinatorial Geometry: 10 (Monographs in Theoretical Computer Science. An EATCS Series) - Tapa dura
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ón1987
- ISBN 10 354013722X
- ISBN 13 9783540137221
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas444
EUR 10,00
EUR 12,00 gastos de envío desde Alemania a Estados Unidos de America
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 94,72
GRATIS gastos de envío en 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 de archivo
Algorithms in Combinatorial Geometry
Publicado por
Springer Berlin, 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
Antiguo o usado
Tapa dura
Librería: BuchKaffee Vividus e.K., Tuebingen, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: Sehr gut. Gebundene Ausgabe Sehr gut. Mit Ausnahme von Direkt-Recycling Materialien erfolgt der Versand ohne Einsatz von Kunststoffen. Sprache: Englisch Gewicht in Gramm: 550. Nº de ref. del artículo: 34243
Gastos de envío:
EUR 12,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (EATCS Monographs on Theoretical Computer Science) (Volume 10)
Librería: Anybook.com, Lincoln, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. Volume 10. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:354013722X. Nº de ref. del artículo: 9435900
Gastos de envío:
EUR 13,97
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Publicado por
Springer (edition 1987), 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
Antiguo o usado
Tapa dura
Librería: BooksRun, Philadelphia, PA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Good. 1987. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Nº de ref. del artículo: 354013722X-11-1
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry
Librería: Anybook.com, Lincoln, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:354013722X. Nº de ref. del artículo: 4145203
Gastos de envío:
EUR 13,97
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Librería: DeckleEdge LLC, Albuquerque, NM, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. Nº de ref. del artículo: Shelfdream354013722X
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Librería: Grumpys Fine Books, Tijeras, NM, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: very good. little wear and tear. Nº de ref. del artículo: Grumpy354013722X
Cantidad disponible: 1 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
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: ABLIING23Mar3113020160294
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Librería: Grumpys Fine Books, Tijeras, NM, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: new. Prompt service guaranteed. Nº de ref. del artículo: Clean354013722X
Cantidad disponible: 1 disponibles
Imagen del vendedor
Algorithms in Combinatorial Geometry
Publicado por
Springer Berlin Heidelberg Jul 1987, 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. 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: 9783540137221
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, 10)
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: ria9783540137221_new
Gastos de envío:
EUR 14,09
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles