A Vertex Concavity-Convexity Detection Method for Three-Dimensional Spatial Objects Based on Geometric Algebra

Abstract

Vertex concavity-convexity detection for spatial objects is a basic algorithm of computer graphics, as well as the foundation for the implementation of other graphics algorithms. In recent years, the importance of the vertex concavity-convexity detection algorithm for three-dimensional (3D) spatial objects has been increasingly highlighted, with the development of 3D modeling, artificial intelligence, and other graphics technologies. Nonetheless, the currently available vertex concavity-convexity detection algorithms mostly use two-dimensional (2D) polygons, with limited research on vertex concavity-convexity detection algorithms for 3D polyhedrons. This study investigates the correlation between the outer product and the topology of the spatial object based on the unique characteristic that the outer product operation in the geometric algebra has unified and definitive geometric implications in space, and with varied dimensionality. Moreover, a multi-dimensional unified vertex concavity-convexity detection algorithm framework for spatial objects is proposed, and this framework is capable of detecting vertex concavity-convexity for both 2D simple polygons and 3D simple polyhedrons.

Current survey of Clifford geometric algebra applications

“…Currently available vertex concavity‐convexity detection algorithms in computer graphics mostly use 2D polygons, with limited research on vertex concavity‐convexity detection algorithms for 3D polyhedrons. The study of Yin et al 229 investigates the correlation between the outer product in GA and the topology of spatial objects with varied dimensionality. A multidimensional unified vertex concavity‐convexity detection algorithm framework for spatial objects is proposed, and this framework is capable of detecting vertex concavity‐convexity for both two and three dimensions.…”