Vilcu costin (26 risultati)

Condizione: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condizione: New. A brand new book in pristine condition. Showing zero signs of shelf wear, creases, or damage.

Condizione: New. In English.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7-11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.…

Condizione: New. pp. 280.

Condizione: New. In English.

Hardcover. Condizione: Brand New. 290 pages. 9.25x6.10x0.87 inches. In Stock.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The focus of this monograph is converting-reshaping-one 3D convex polyhedron to another via an operation the authors call 'tailoring.' A convex polyhedron is a gem-like shape composed of flat facets, the focus of study since Plato and Euclid. The tailoring operation snips off a corner (a 'vertex') of a polyhedron and sutures closed the hole. This is akin to Johannes Kepler's 'vertex truncation,' but differs in that the hole left by a truncated vertex is filled with new surface, whereas tailoring zips the hole closed. A powerful 'gluing' theorem of A.D. Alexandrov from 1950 guarantees that, after closing the hole, the result is a new convex polyhedron. Given two convex polyhedra P, and Q inside P, repeated tailoringallows P to be reshaped to Q. Rescaling any Q to fit inside P, the result is universal: any P can be reshaped to any Q. This is one of the main theorems in Part I, with unexpected theoretical consequences.Part II carries out a systematic study of 'vertex-merging,' a technique that can be viewed as a type of inverse operation to tailoring. Here the start is P which is gradually enlarged as much as possible, by inserting new surface along slits. In a sense, repeated vertex-merging reshapes P to be closer to planarity. One endpoint of such a process leads to P being cut up and 'pasted' inside a cylinder. Then rolling the cylinder on a plane achieves an unfolding of P. The underlying subtext is a question posed by Geoffrey Shephard in 1975 and already implied by drawings by Albrecht Dürer in the 15th century: whether every convex polyhedron can be unfolded to a planar 'net.' Toward this end, the authors initiate an exploration of convexity on convex polyhedra, a topic rarely studiedin the literature but with considerable promise for future development.This monograph uncovers new research directions and reveals connections among several, apparently distant, topics in geometry: Alexandrov's Gluing Theorem, shortest paths and cut loci, Cauchy's Arm Lemma, domes, quasigeodesics, convexity, and algorithms throughout. The interplay between these topics and the way the main ideas develop throughout the book could make the 'journey' worthwhile for students and researchers in geometry, even if not directly interested in specific topics. Parts of the material will be of interest and accessible even to undergraduates. Although the proof difficulty varies from simple to quite intricate, with some proofs spanning several chapters, many examples and 125 figures help ease the exposition and illustrate the concepts.…

Condizione: New.

Condizione: New. 2024th edition NO-PA16APR2015-KAP.

Hardcover. Condizione: Brand New. 257 pages. 9.26x6.10x0.75 inches. In Stock.

Hardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: new. Questo è un articolo print on demand.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7-11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems. 292 pp. Englisch. …

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes overviews of evolving areas in convexity, discrete geometry and graph theoryPresents easily understandable, but surprising, properties, obtained using topological, geometric and graph theoretic toolsWritten b.…

Hardcover. Condizione: Brand New. 257 pages. 9.26x6.10x0.75 inches. In Stock. This item is printed on demand.

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The focus of this monograph is converting-reshaping-one 3D convex polyhedron to another via an operation the authors call 'tailoring.' A convex polyhedron is a gem-like shape composed of flat facets, the focus of study since Plato and Euclid. The tailoring operation snips off a corner (a 'vertex') of a polyhedron and sutures closed the hole. This is akin to Johannes Kepler's 'vertex truncation,' but differs in that the hole left by a truncated vertex is filled with new surface, whereas tailoring zips the hole closed. A powerful 'gluing' theorem of A.D. Alexandrov from 1950 guarantees that, after closing the hole, the result is a new convex polyhedron. Given two convex polyhedra P, and Q inside P, repeated tailoringallows P to be reshaped to Q. Rescaling any Q to fit inside P, the result is universal: any P can be reshaped to any Q. This is one of the main theorems in Part I, with unexpected theoretical consequences.Part II carries out a systematic study of 'vertex-merging,' a technique that can be viewed as a type of inverse operation to tailoring. Here the start is P which is gradually enlarged as much as possible, by inserting new surface along slits. In a sense, repeated vertex-merging reshapes P to be closer to planarity. One endpoint of such a process leads to P being cut up and 'pasted' inside a cylinder. Then rolling the cylinder on a plane achieves an unfolding of P. The underlying subtext is a question posed by Geoffrey Shephard in 1975 and already implied by drawings by Albrecht Dürer in the 15th century: whether every convex polyhedron can be unfolded to a planar 'net.' Toward this end, the authors initiate an exploration of convexity on convex polyhedra, a topic rarely studiedin the literature but with considerable promise for future development.This monograph uncovers new research directions and reveals connections among several, apparently distant, topics in geometry: Alexandrov's Gluing Theorem, shortest paths and cut loci, Cauchy's Arm Lemma, domes, quasigeodesics, convexity, and algorithms throughout. The interplay between these topics and the way the main ideas develop throughout the book could make the 'journey' worthwhile for students and researchers in geometry, even if not directly interested in specific topics. Parts of the material will be of interest and accessible even to undergraduates. Although the proof difficulty varies from simple to quite intricate, with some proofs spanning several chapters, many examples and 125 figures help ease the exposition and illustrate the concepts. 260 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The focus of this monograph is converting-reshaping-one 3D convex polyhedron to another via an operation the authors call tailoring. A convex polyhedron is a gem-like shape composed of flat facets, the focus of study since Plato and Eucli.…

Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7¿11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 292 pp. Englisch. …

Condizione: New. Print on Demand pp. 280.

Condizione: New. PRINT ON DEMAND pp. 280.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The focus of this monograph is converting-reshaping-one 3D convex polyhedron to another via an operation the authors call 'tailoring.' A convex polyhedron is a gem-like shape composed of flat facets, the focus of study since Plato and Euclid. The tailoring operation snips off a corner (a 'vertex') of a polyhedron and sutures closed the hole. This is akin to Johannes Kepler's 'vertex truncation,' but differs in that the hole left by a truncated vertex is filled with new surface, whereas tailoring zips the hole closed. A powerful 'gluing' theorem of A.D. Alexandrov from 1950 guarantees that, after closing the hole, the result is a new convex polyhedron. Given two convex polyhedra P, and Q inside P, repeated tailoringallows P to be reshaped to Q. Rescaling any Q to fit inside P, the result is universal: any P can be reshaped to any Q. This is one of the main theorems in Part I, with unexpected theoretical consequences.Part II carries out a systematic study of 'vertex-merging,' a technique that can be viewed as a type of inverse operation to tailoring. Here the start is P which is gradually enlarged as much as possible, by inserting new surface along slits. In a sense, repeated vertex-merging reshapes P to be closer to planarity. One endpoint of such a process leads to P being cut up and 'pasted' inside a cylinder. Then rolling the cylinder on a plane achieves an unfolding of P. The underlying subtext is a question posed by Geoffrey Shephard in 1975 and already implied by drawings by Albrecht Dürer in the 15th century: whether every convex polyhedron can be unfolded to a planar 'net.' Toward this end, the authors initiate an exploration of convexity on convex polyhedra, a topic rarely studiedin the literature but with considerable promise for future development.This monograph uncovers new research directions and reveals connections among several, apparently distant, topics in geometry: Alexandrov's Gluing Theorem, shortest paths and cut loci, Cauchy's Arm Lemma, domes, quasigeodesics, convexity, and algorithms throughout. The interplay between these topics and the way the main ideas develop throughout the book could make the 'journey' worthwhile for students and researchers in geometry, even if not directly interested in specific topics. Parts of the material will be of interest and accessible even to undergraduates. Although the proof difficulty varies from simple to quite intricate, with some proofs spanning several chapters, many examples and 125 figures help ease the exposition and illustrate the concepts.…

Condizione: New. Print on Demand.

Condizione: New. Print on Demand.

Condizione: New. PRINT ON DEMAND.

Condizione: New. PRINT ON DEMAND.