Fogel Efraim (7 results)
Published by Sholem Aleichem Yugent Gezelshaft, New York 1941
- Softcover
Seller: Henry Hollander, Bookseller, Los Angeles, U.S.A.Henry Hollander, Bookseller
Contact seller4-star sellerCondition: Used - Very good
£ 13.78
£ 5.20 shippingShips within U.S.A.Quantity: 1 available
Add to basketSoftbound. Condition: Very Good. Octavo, stapled paper covers, 24 pp. Text is in Yiddish.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 45.51
£ 60.65 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Minkowski Sum Construction and other Applications of Arrangements | and the Importance of Being Exact | Efraim Fogel | Taschenbuch | 144 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783843380942 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norder…stedt, info[at]bod[dot]de | Anbieter: preigu.
Minkowski Sum Construction and other Applications of Arrangements: and the Importance of Being Exact
- Softcover
Seller: Mispah books, Redhill, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 116.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by LAP LAMBERT Academic Publishing Dez 2010 2010
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
£ 52.65
£ 19.93 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polytopes in three-dimensional space. We do not assume general position. Namely, we handle degenerate input and…produce exact results. We provide a tight bound on the exact maximum complexity of Minkowski sums of convex polytopes in the space in terms of the number of facets of the summands. The complexity of Minkowski sum structures is directly related to the time consumption of our Minkowski sum constructions, as they are output sensitive. The algorithms employ a data structure that represents arrangements embedded on two-dimensional parametric surfaces in the space and make use of many operations applied to arrangements. We also present an exact implementations an efficient algorithm that partitions an assembly of polytopes in the space with two hands using infinite translations. This application makes extensive use of Minkowski-sum constructions and other operations on arrangements of geodesic arcs embedded on the sphere. It distinctly shows the importance of exact computation, as imprecise computation might result with dismissal of valid partitioning-motions. 144 pp. Englisch.
- Softcover
- Print on Demand
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
£ 43.29
£ 42.45 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Fogel EfraimDr. Efraim Fogel (Efi) is a researcher in the Blavatnik school of computer science at the Tel Aviv university, Israel, and a consultant in the fields of Computational Geometry and 3D Graphic…s. Efi received a Ph.D. degree .
Language: English
Published by LAP LAMBERT Academic Publishing Dez 2010 2010
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
£ 52.65
£ 51.99 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polytopes in three-dimensional space. We do not assume general position. Namely, we handle degenerate input and prod…uce exact results. We provide a tight bound on the exact maximum complexity of Minkowski sums of convex polytopes in the space in terms of the number of facets of the summands. The complexity of Minkowski sum structures is directly related to the time consumption of our Minkowski sum constructions, as they are output sensitive. The algorithms employ a data structure that represents arrangements embedded on two-dimensional parametric surfaces in the space and make use of many operations applied to arrangements. We also present an exact implementations an efficient algorithm that partitions an assembly of polytopes in the space with two hands using infinite translations. This application makes extensive use of Minkowski-sum constructions and other operations on arrangements of geodesic arcs embedded on the sphere. It distinctly shows the importance of exact computation, as imprecise computation might result with dismissal of valid partitioning-motions.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 144 pp. Englisch.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 52.65
£ 53.00 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polytopes in three-dimensional space. We do not assume general position. Namely, we handle degenerate input and produ…ce exact results. We provide a tight bound on the exact maximum complexity of Minkowski sums of convex polytopes in the space in terms of the number of facets of the summands. The complexity of Minkowski sum structures is directly related to the time consumption of our Minkowski sum constructions, as they are output sensitive. The algorithms employ a data structure that represents arrangements embedded on two-dimensional parametric surfaces in the space and make use of many operations applied to arrangements. We also present an exact implementations an efficient algorithm that partitions an assembly of polytopes in the space with two hands using infinite translations. This application makes extensive use of Minkowski-sum constructions and other operations on arrangements of geodesic arcs embedded on the sphere. It distinctly shows the importance of exact computation, as imprecise computation might result with dismissal of valid partitioning-motions.
