Related papers: Clean up your Mesh! Part 1: Plane and simplex
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet…
The article presents a new approach to euclidean plane geometry based on projective geometric algebra (PGA). It is designed for anyone with an interest in plane geometry, or who wishes to familiarize themselves with PGA. After a brief…
What is the best representation for doing euclidean geometry on computers? These notes from a SIGGRAPH 2019 short course entitled "Geometric algebra for computer graphics" introduce projective geometric algebra (PGA) as a modern framework…
The present paper suggests a new approach for geometric representation of 3D spatial models and provides a new compression algorithm for 3D meshes, which is based on mathematical theory of convex geometry. In our approach we represent a 3D…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
Plane-based Geometric Algebra (PGA) has revealed points in a $d$-dimensional pseudo-Euclidean space $\mathbb{R}_{p,q,1}$ to be represented by $d$-blades rather than vectors. This discovery allows points to be factored into $d$ orthogonal…
Historically, there have been many attempts to produce an appropriate mathematical formalism for modeling the nature of physical space, such as Euclid's geometry, Descartes' system of Cartesian coordinates, the Argand plane, Hamilton's…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
The discussion of how to apply geometric algebra to euclidean $n$-space has been clouded by a number of conceptual misunderstandings which we first identify and resolve, based on a thorough review of crucial but largely forgotten themes…
In this Master of Science Thesis I introduce geometric algebra both from the traditional geometric setting of vector spaces, and also from a more combinatorial view which simplifies common relations and operations. This view enables us to…
We consider regular tessellations of the plane as infinite graphs in which $q$ edges and $q$ faces meet at each vertex, and in which $p$ edges and $p$ vertices surround each face. For $1/p + 1/q = 1/2$, these are tilings of the Euclidean…
A new simplified approach for teaching electromagnetism is presented using the formalism of geometric algebra (GA) which does not require vector calculus or tensor index notation, thus producing a much more accessible presentation for…
We present a simple yet general and efficient approach to representation of computational meshes. Meshes are represented as sets of mesh entities of different topological dimensions and their incidence relations. We discuss a…
Plane arrangements are a useful tool for surface and volume modelling. However, their main drawback is poor scalability. We introduce two key novelties that enable the construction of plane arrangements for complex objects and entire…
A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…
We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact, symplectic, complex and almost complex structures. We start with a series of local rigidity results…
We show that main results of rational trigonometry (as developed by NJ Wildberger, "Divine Proportions", 2005) can be succinctly expressed using projective geometric algebra (PGA). In fact, the PGA representation exhibits distinct…
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.)…
Volume parameterizations abound in recent literature, from the classic voxel grid to the implicit neural representation and everything in between. While implicit representations have shown impressive capacity and better memory efficiency…
We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…