Computational geometry algorithms and data structures are widely applied across numerous scientific domains, and there a variety of R packages that implement computational geometry functionality. However, these packages often work in specific numbers of dimensions, do not have directly compatible data structures, and include additional non-computational geometry functionality that can be domain specific. Our objective in developing the compGeometeR package is to implement in a generic and consistent framework the most commonly used combinatorial computational geometry algorithms so that they can be easily combined and integrated into domain specific scientific workflows. We briefly explain the discrete and digital combinatorial computational geometry algorithms available in compGeometeR, and identify priorities for future development.
Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry
