No abstract uploaded!

In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad dominant mesh with edges well aligned to the principal directions of the underlying surface. Instead of computing a globally smooth parameterization or integrating curvature lines along a tangent vector field, we simply apply an iterative relaxation scheme which incrementally aligns the mesh edges to the principal directions. We further obtain the quad dominant mesh by dropping the not-aligned diagonal edges from the triangle mesh. A post-processing stage is introduced to further improve the results. The major advantage of our algorithm is its conceptual simplicity since it is merely based on elementary mesh operations such as edge collapse, flip, and split. Various results are presented in the paper; they show a good alignment to surface features and rather uniform distribution of mesh vertices. This makes them well suited, e.g., as CatmullClark Subdivision control meshes.

No abstract uploaded!

Comparing DNA and protein sequence groups plays an important role in biological evolutionary relationship research. Despite many methods available for sequence comparison, only a few can be used for group comparison. In this study, we propose a novel approach using convex hulls. We use statistical information contained within the sequences to represent each sequence as a point in high dimensional space. We find that the points belonging to one biological group are located in a different region of space than points belonging to other biological groups. To be more precise, the convex hull of the points from one group are disjoint from the convex hulls of points from other groups. This finding allows us to do phylogenetic analysis for groups in an efficient way. Five different theorems are presented for checking whether two convex hulls intersect or are disjoint. Test results for datasets related to HRV, HPV, Ebolavirus, PKC and protein phosphatase domains demonstrate that our method performs well and provides a new tool for studying group phylogeny. More significantly, the convex analysis presents a new way to search for sequences belonging to a biological group by examining points within the group’s convex hull.

We study BPS spectra of D-branes on local Calabi-Yau threefolds O(−p)⊕O(p−2)→P^1 with p=0,1, corresponding to C^3/Z_2 and the resolved conifold. Nonabelianization for exponential networks is applied to compute directly unframed BPS indices counting states with D2 and D0 brane charges. Known results on these BPS spectra are correctly reproduced by computing new types of BPS invariants of 3d-5d BPS states, encoded by nonabelianization, through their wall-crossing. We also develop the notion of exponential BPS graphs for the simplest toric examples, and show that they encode both the quiver and the potential associated to the Calabi-Yau via geometric engineering.