ABSTRACT
In this work, we present some of the unexpected observations resulted from our recent research. We, recently, needed to identify a small number of important critical points, i.e. minimum, maximum and saddle points, on a given manifold mesh surface. All critical points on a manifold triangular mesh can be identified using discrete Gaussian curvature, which is given as ki = 2π − Σj θi,j where ki is vertex defect (the discrete Gaussian curvature) of the vertex i and θi,j is the corner of the vertex in the triangle j. A very useful property coming with vertex defect is the discrete version of Gauss-Bonnet theorem: the sum of all vertex defects is always constant as Σi ki = 2π(2−2g) where g is the genus of the mesh. Any vertex with a non-zero vertex defect is really an critical point of the surface. However, identification of interesting critical points is hard with vertex defect alone. As it can be seen in Figure 1(a), even we ignore vertex defects that are small, too many vertices are still chosen and this information is not really useful to make any conclusion of the shape of the surface.
Index Terms
Critical points with discrete Morse theory
Recommendations
Factor-critical property in 3-dominating-critical graphs
A vertex subset S of a graph G is a dominating set if every vertex of G either belongs to S or is adjacent to a vertex of S. The cardinality of a smallest dominating set is called the dominating number of G and is denoted by @c(G). A graph G is said to ...
On 4-γt -critical graphs of diameter two
A vertex subset S of graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S. For a graph G with no isolated vertex, the total domination number of G, denoted by @c"t(G), is the minimum cardinality of a total dominating ...
Matchings in 3-vertex-critical graphs: The odd case
A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjacent to one in D. The cardinality of any smallest dominating set in G is denoted by @c(G) and called the domination number of G. Graph G is said to be @c-...
Comments