Fogel efraim (7 resultados)
Editorial: Sholem Aleichem Yugent Gezelshaft, New York, 1941
- Tapa blanda
Librería: Henry Hollander, Bookseller, Los Angeles, CA, Estados Unidos de AmericaHenry Hollander, Bookseller
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Bueno
EUR 16,22
Envío por EUR 6,12Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Softbound. Condición: Very Good. Octavo, stapled paper covers, 24 pp. Text is in Yiddish.
Minkowski Sum Construction and other Applications of Arrangements: and the Importance of Being Exact
- Tapa blanda
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Usado - Como Nuevo
EUR 140,17
Envío por EUR 29,33Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 59,00
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: 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.
- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 48,50
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: 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 .
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 59,00
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
- Tapa blanda
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 51,10
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: 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 Print on Demand.
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 59,71
Envío por EUR 61,17Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: 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.
