301 research outputs found
Planare Graphen und ihre Dualgraphen auf ZylinderoberflÀchen
In this thesis, we investigates plane drawings of undirected and directed graphs on cylinder surfaces. In the case of undirected graphs, the vertices are positioned on a line that is parallel to the cylinderâs axis and the edge curves must not intersect this line. We show that a plane drawing is possible if and only if the graph is a double-ended queue (deque) graph, i. e., the vertices of the graph can be processed according to a linear order and the edges correspond to items in the deque inserted and removed at their end vertices. A surprising consequence resulting from these observations is that the deque characterizes planar graphs with a Hamiltonian path. This result extends the known characterization of planar graphs with a Hamiltonian cycle by two stacks. By these insights, we also obtain a new characterization of queue graphs and their duals. We also consider the complexity of deciding whether a graph is a deque graph and prove that it is NP-complete. By introducing a split operation, we obtain the splittable deque and show that it characterizes planarity. For the proof, we devise an algorithm that uses the splittable deque to test whether a rotation system is planar. In the case of directed graphs, we study upward plane drawings where the edge curves follow the direction of the cylinderâs axis (standing upward planarity; SUP) or they wind around the axis (rolling upward planarity; RUP). We characterize RUP graphs by means of their duals and show that RUP and SUP swap their roles when considering a graph and its dual. There is a physical interpretation underlying this characterization: A SUP graph is to its RUP dual graph as electric current passing through a conductor to the magnetic field surrounding the conductor. Whereas testing whether a graph is RUP is NP-hard in general [Bra14], for directed graphs without sources and sink, we develop a linear-time recognition algorithm that is based on our dual graph characterization of RUP graphs.Die Arbeit beschĂ€ftigt sich mit planaren Zeichnungen ungerichteter und gerichteter Graphen auf ZylinderoberflĂ€chen. Im ungerichteten Fall werden Zeichnungen betrachtet, bei denen die Knoten auf einer Linie parallel zur Zylinderachse positioniert werden und die Kanten diese Linie nicht schneiden dĂŒrfen. Es kann gezeigt werden, dass eine planare Zeichnung genau dann möglich ist, wenn die Kanten des Graphen in einer double-ended queue (Deque) verarbeitet werden können. Ebenso lassen sich dadurch Queue, Stack und Doppelstack charakterisieren. Eine ĂŒberraschende Konsequenz aus diesen Erkenntnissen ist, dass die Deque genau die planaren Graphen mit Hamiltonpfad charakterisiert. Dies erweitert die bereits bekannte Charakterisierung planarer Graphen mit Hamiltonkreis durch den Doppelstack. Im gerichteten Fall mĂŒssen die Kantenkurven entweder in Richtung der Zylinderachse verlaufen (SUP-Graphen) oder sich um die Achse herumbewegen (RUP-Graphen). Die Arbeit charakterisiert RUP-Graphen und zeigt, dass RUP und SUP ihre Rollen tauschen, wenn man Graph und Dualgraph betrachtet. Der SUP-Graph verhĂ€lt sich dabei zum RUP-Graphen wie elektrischer Strom durch einen Leiter zum induzierten Magnetfeld. Ausgehend von dieser Charakterisierung ist es möglich einen Linearzeit-Algorithmus zu entwickeln, der entscheidet ob ein gerichteter Graph ohne Quellen und Senken ein RUP-Graph ist, wĂ€hrend der allgemeine Fall NP-hart ist [Bra14]
Extending Upward Planar Graph Drawings
In this paper we study the computational complexity of the Upward Planarity
Extension problem, which takes in input an upward planar drawing of
a subgraph of a directed graph and asks whether can be
extended to an upward planar drawing of . Our study fits into the line of
research on the extensibility of partial representations, which has recently
become a mainstream in Graph Drawing.
We show the following results.
First, we prove that the Upward Planarity Extension problem is NP-complete,
even if has a prescribed upward embedding, the vertex set of coincides
with the one of , and contains no edge.
Second, we show that the Upward Planarity Extension problem can be solved in
time if is an -vertex upward planar -graph. This
result improves upon a known -time algorithm, which however applies to
all -vertex single-source upward planar graphs.
Finally, we show how to solve in polynomial time a surprisingly difficult
version of the Upward Planarity Extension problem, in which is a directed
path or cycle with a prescribed upward embedding, contains no edges, and no
two vertices share the same -coordinate in
Modelling of Bulk Material Flow Properties
Flow property testing is important in the design of handling equipment for bulk solids and the Jenike shear tester is a common and reliable method for ensuring flow from hoppers under the force of gravity alone. The Jenike shear test procedure has various stages and is known to have issues with operator dependency, questions have also been raised regarding the stress state within the shear cell.
Currently the data for high pressure flow functions, which are applicable to large capacity storage facilities, are extrapolated from low pressure test data using a 3-parameter equation. Very little literature is provided to support the use of the 3-parameter equation and most shear testing devices are limited to major consolidation stresses of 100 kPa
SAFETY CONCEPTS FOR EVERY RIDE: A STATISTICAL ENSEMBLE SIMULATION TO MITIGATE ROTATIONAL FALLS IN EVENTING CROSS COUNTRY
Rotational falls are the leading cause of death and serious injury in the equestrian sport of eventing. Previous studies to develop safety devices used physical models representing one or at most several physical situations leading to different designs and no common understanding. In this thesis, a statistical ensemble model is developed and applied to generate and evaluate 10,000 different situations that might potentially lead to rotational falls. For accurate statistical representation of the horse and rider inertia distributions, measurements of over 400 training or competing horses and riders were recorded and incorporated. Video was recorded of 218 total competitors approaching 10 different jumps on cross country courses in competitions ranging from Preliminary to CCI5*, yielding jump configuration angles for different fence types. Combining information for these, among 26 total variables, a statistical ensemble simulation using impulse momentum physics identifies conditions for rotation and defines design criteria for future general and situation-specific jumps and safety devices. A Jump Safety Quality Index is also devised to represent the benefit of an activating fence design for mitigating rotational falls versus the detriment and competition penalties of false activation
- âŠ