Deul, Crispin ; Burger, Michael ; Hildenbrand, Dietmar ; Koch, Andreas (2022)
Raytracing Point Clouds Using Geometric Algebra.
International Workshop on Computer Graphics, Computer Vision and Mathematics. Plzen, Czech Republic (01.-04.09.2009)
doi: 10.26083/tuprints-00021261
Konferenzveröffentlichung, Zweitveröffentlichung, Verlagsversion
Kurzbeschreibung (Abstract)
Geometric Algebra (GA) supports the geometrically intuitive development of an algorithm with its build-in geometric primitives such as points, lines, spheres or planes. But on the negative side GA has a huge computational footprint. In this paper we study how GA can compete with traditional methods from Linear Algebra (LA) in the field of raytracing. We examine the raytracing algorithm for both GA and LA on the basis of primitive operations. Furthermore we introduce a novel framework for rendering point clouds based on spheres and planes as surface elements. We use this model to benchmark implementations of both algebras. Our results show that depending on the microprocessor architecture like CPUs, FPGAs or GPUs Geometric Algebra and Linear Algebra can raytrace with comparable speed.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2022 |
| Autor(en): | Deul, Crispin ; Burger, Michael ; Hildenbrand, Dietmar ; Koch, Andreas |
| Art des Eintrags: | Zweitveröffentlichung |
| Titel: | Raytracing Point Clouds Using Geometric Algebra |
| Sprache: | Englisch |
| Publikationsjahr: | 2022 |
| Ort: | Darmstadt |
| Verlag: | University of West Bohemia, Plzen |
| Buchtitel: | GraVisMa 2009 Proceedings |
| Veranstaltungstitel: | International Workshop on Computer Graphics, Computer Vision and Mathematics |
| Veranstaltungsort: | Plzen, Czech Republic |
| Veranstaltungsdatum: | 01.-04.09.2009 |
| DOI: | 10.26083/tuprints-00021261 |
| URL / URN: | https://tuprints.ulb.tu-darmstadt.de/21261 |
| Zugehörige Links: | |
| Herkunft: | Zweitveröffentlichungsservice |
| Kurzbeschreibung (Abstract): | Geometric Algebra (GA) supports the geometrically intuitive development of an algorithm with its build-in geometric primitives such as points, lines, spheres or planes. But on the negative side GA has a huge computational footprint. In this paper we study how GA can compete with traditional methods from Linear Algebra (LA) in the field of raytracing. We examine the raytracing algorithm for both GA and LA on the basis of primitive operations. Furthermore we introduce a novel framework for rendering point clouds based on spheres and planes as surface elements. We use this model to benchmark implementations of both algebras. Our results show that depending on the microprocessor architecture like CPUs, FPGAs or GPUs Geometric Algebra and Linear Algebra can raytrace with comparable speed. |
| Freie Schlagworte: | Forschungsgruppe Geometric Algebra Computing (GACO), Geometric algebra (GA), General Purpose Computation on Graphics Processing Unit (GPGPU), Point clouds, Field-programmable gate array (FPGA) |
| Status: | Verlagsversion |
| URN: | urn:nbn:de:tuda-tuprints-212616 |
| Sachgruppe der Dewey Dezimalklassifikatin (DDC): | 000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik 500 Naturwissenschaften und Mathematik > 510 Mathematik |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Eingebettete Systeme und ihre Anwendungen 20 Fachbereich Informatik > Graphisch-Interaktive Systeme 20 Fachbereich Informatik > Scientific Computing 20 Fachbereich Informatik > Simulation of multibody systems and deformable bodies |
| Hinterlegungsdatum: | 03 Mai 2022 11:52 |
| Letzte Änderung: | 04 Mai 2022 13:05 |
| PPN: | |
| Zugehörige Links: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum