Da: Anybook.com, Lincoln, Regno Unito
EUR 44,50
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,800grams, ISBN:9783540332589.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 116,64
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 119,03
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 116,53
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 116,51
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2006
ISBN 10: 3540332588 ISBN 13: 9783540332589
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 114,36
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational geometry emerged as a discipline in the seventies and has had considerable success in improving the asymptotic complexity of the solutions tobasicgeometricproblemsincludingconstructionsofdatastructures,convex hulls, triangulations, Voronoi diagrams and geometric arrangements as well as geometric optimisation. However, in the mid-nineties, it was recognized that the computational geometry techniques were far from satisfactory in practice and a vigorous e ort has been undertaken to make computational geometry more practical. This e ort led to major advances in robustness, geometric software engineering and experimental studies, and to the development of a large library of computational geometry algorithms, Cgal. The goal of this book is to take into consideration the multidisciplinary nature of the problem and to provide solid mathematical and algorithmic foundationsfore ectivecomputationalgeometryforcurvesandsurfaces. This book covers two main approaches. In a rst part, we discuss exact geometric algorithms for curves and s- faces. We revisit two prominent data structures of computational geometry, namely arrangements (Chap. 1) and Voronoi diagrams (Chap. 2) in order to understand how these structures, which are well-known for linear objects, behave when de ned on curved objects. The mathematical properties of these structures are presented together with algorithms for their construction. To ensure the e ectiveness of our algorithms, the basic numerical computations that need to be performed are precisely speci ed, and tradeo s are considered between the complexity of the algorithms (i. e. the number of primitive calls), and the complexity of the primitives and their numerical stability. Chap.
Da: Buchpark, Trebbin, Germania
EUR 87,20
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Hervorragend. Zustand: Hervorragend | Seiten: 356 | Sprache: Englisch | Produktart: Bücher | Computational geometry emerged as a discipline in the seventies and has had considerable success in improving the asymptotic complexity of the solutions tobasicgeometricproblemsincludingconstructionsofdatastructures,conve x hulls, triangulations, Voronoi diagrams and geometric arrangements as well as geometric optimisation. However, in the mid-nineties, it was recognized that the computational geometry techniques were far from satisfactory in practice and a vigorous e?ort has been undertaken to make computational geometry more practical. This e?ort led to major advances in robustness, geometric software engineering and experimental studies, and to the development of a large library of computational geometry algorithms, Cgal. The goal of this book is to take into consideration the multidisciplinary nature of the problem and to provide solid mathematical and algorithmic foundationsfore?ectivecomputationalgeometryforcurvesandsurfac es. This book covers two main approaches. In a ?rst part, we discuss exact geometric algorithms for curves and s- faces. We revisit two prominent data structures of computational geometry, namely arrangements (Chap. 1) and Voronoi diagrams (Chap. 2) in order to understand how these structures, which are well-known for linear objects, behave when de?ned on curved objects. The mathematical properties of these structures are presented together with algorithms for their construction. To ensure the e?ectiveness of our algorithms, the basic numerical computations that need to be performed are precisely speci?ed, and tradeo?s are considered between the complexity of the algorithms (i. e. the number of primitive calls), and the complexity of the primitives and their numerical stability. Chap.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 235,73
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 226,12
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 259,40
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Okt 2006, 2006
ISBN 10: 3540332588 ISBN 13: 9783540332589
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 106,99
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and efficient in practice. Coverage includes references to open source software and discussion of potential applications of the presented techniques. 356 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 2006
ISBN 10: 3540332588 ISBN 13: 9783540332589
Da: moluna, Greven, Germania
EUR 92,27
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Contains recent progress in the interaction of mathematics, computer graphics, and CAGDThis book covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational top.
Lingua: Inglese
Editore: Springer, Springer Okt 2006, 2006
ISBN 10: 3540332588 ISBN 13: 9783540332589
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 106,99
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This title outlines the foundations of non-linear computational geometry. It covers combinatorial data structures and algorithms, algebraic issues in geometric computing, approximation of curves and surfaces, and computational topology. Each chapter fully details and provides a tutorial introduction to important concepts and results. The focus is on methods which are both well founded mathematically and efficient in practice. Coverage includes references to open source software and discussion of potential applications of the presented techniques. This book can serve as a textbook on non-linear computational geometry. It will also be useful to engineers and researchers working in computational geometry or other fields, like structural biology, 3D medical imaging, CAD/CAM, robotics, and graphics.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 356 pp. Englisch.