A secondary purpose of this repository is to provide a generalized graph API that enables implementation of a very wide range of in-memory graph algorithms including basic methods for reading, writing ...

Triangle is specialized for creating two-dimensional finite element meshes, but can also perform simpler related tasks such as forming Delaunay triangulations. Here is a sample Planar Straight Line ...

Abstract: A new graph dual formalism is presented for the analysis of line outages in electricity networks. The dual formalism is based on a consideration of the flows around closed cycles in the ...

We present an algorithm for enumerating all possible faceting arrangements of dihedrally symmetric diamond cuts. We first separate the question into enumerating crowns a ...

Notice that this work is based on the original OpenVSLAM (renamed now as stella-vslam), which is a derivative work of ORB-SLAM2 without any modification to core algorithms. It was declared in conflict ...

Ruppert's algorithm for two-dimensional quality mesh generation [15] is perhaps the first theoretically guaranteed meshing algorithm to be truly satisfactory in practice. It produces meshes with no ...

This paper aims to organize the research generation process that led from structural philosophy through mathematical modeling to the exploration of an unsolved problem in graph theory as a case study.