25,013 research outputs found
Shortest path embeddings of graphs on surfaces
The classical theorem of F\'{a}ry states that every planar graph can be
represented by an embedding in which every edge is represented by a straight
line segment. We consider generalizations of F\'{a}ry's theorem to surfaces
equipped with Riemannian metrics. In this setting, we require that every edge
is drawn as a shortest path between its two endpoints and we call an embedding
with this property a shortest path embedding. The main question addressed in
this paper is whether given a closed surface S, there exists a Riemannian
metric for which every topologically embeddable graph admits a shortest path
embedding. This question is also motivated by various problems regarding
crossing numbers on surfaces.
We observe that the round metrics on the sphere and the projective plane have
this property. We provide flat metrics on the torus and the Klein bottle which
also have this property.
Then we show that for the unit square flat metric on the Klein bottle there
exists a graph without shortest path embeddings. We show, moreover, that for
large g, there exist graphs G embeddable into the orientable surface of genus
g, such that with large probability a random hyperbolic metric does not admit a
shortest path embedding of G, where the probability measure is proportional to
the Weil-Petersson volume on moduli space.
Finally, we construct a hyperbolic metric on every orientable surface S of
genus g, such that every graph embeddable into S can be embedded so that every
edge is a concatenation of at most O(g) shortest paths.Comment: 22 pages, 11 figures: Version 3 is updated after comments of
reviewer
Feature Lines for Illustrating Medical Surface Models: Mathematical Background and Survey
This paper provides a tutorial and survey for a specific kind of illustrative
visualization technique: feature lines. We examine different feature line
methods. For this, we provide the differential geometry behind these concepts
and adapt this mathematical field to the discrete differential geometry. All
discrete differential geometry terms are explained for triangulated surface
meshes. These utilities serve as basis for the feature line methods. We provide
the reader with all knowledge to re-implement every feature line method.
Furthermore, we summarize the methods and suggest a guideline for which kind of
surface which feature line algorithm is best suited. Our work is motivated by,
but not restricted to, medical and biological surface models.Comment: 33 page
Hand geometry recognition: an approach for closed and separated fingers
Hand geometry has been a biometric trait that has attracted attention from several researchers. This stems from the fact that it is less intrusive and could be captured without contact with the acquisition device. Its application ranges from forensic examination to basic authentication use. However, restrictions in hand placement have proven to be one of its challenges. Users are either instructed to keep their fingers separate or closed during capture. Hence, this paper presents an approach to hand geometry using finger measurements that considers both closed and separate fingers. The system starts by cropping out the finger section of the hand and then resizing the cropped fingers. 20 distances were extracted from each finger in both separate and closed finger images. A comparison was made between Manhattan distance and Euclidean distance for features extraction. The support vector machine (SVM) was used for classification. The result showed a better result for Euclidean distance with a false acceptance ratio (FAR) of 0.6 and a false rejection ratio (FRR) of 1.2
Bounds for the genus of a normal surface
This paper gives sharp linear bounds on the genus of a normal surface in a
triangulated compact, orientable 3--manifold in terms of the quadrilaterals in
its cell decomposition---different bounds arise from varying hypotheses on the
surface or triangulation. Two applications of these bounds are given. First,
the minimal triangulations of the product of a closed surface and the closed
interval are determined. Second, an alternative approach to the realisation
problem using normal surface theory is shown to be less powerful than its dual
method using subcomplexes of polytopes.Comment: 38 pages, 25 figure
- …