Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
Dan Archdeacon, C. Paul Bonnington, Joanna A. Elli...
Quantizing real-valued templates into binary strings is a fundamental step in biometric compression and template protection. In this paper, we introduce the area under the FRR cur...
Many algorithms suppress skeleton associated with boundary perturbation by preventing their formation or by costly branch pruning. This work proposes a novel concept of structural...
Background: Accurate identification of protein domain boundaries is useful for protein structure determination and prediction. However, predicting protein domain boundaries from a...
We present a geometric model and a computational method for segmentation of images with missing boundaries. In many situations, the human visual system fills in missing gaps in ed...