888 research outputs found

    Curvature in hand movements as a result of visual misjudgements of direction

    Get PDF
    The path that our hand takes when moving from one position to another is often slightly curved. Part of this curvature is caused by perceptual errors. We examine here whether this is so for the influence that a surface's orientation has on the approaching hand's path. When moving our hand towards a point on a surface we tend to follow a path that makes the final approach more orthogonal to the surface at that point. Doing so makes us less sensitive to imperfection in controlling our movements. Here we show that this tendency is also present when moving towards a point along an edge of a drawing of an oriented bar. The influence of the bar's orientation is no smaller when people are explicitly asked to move as straight as possible, than when they are instructed to move as fast as possible. The bar's orientation also influences perceptual judgements of a straight path, but this influence is only as large as it is on the curvature of the hand's path for judgements of the direction from the hand's initial position to the target. We conclude that the influence of the bar's orientation on the curvature of the hand's path is caused by a misperception of the initial direction in which the hand has to move to reach the target

    Irregular shaped building design optimization with building information modelling

    Get PDF
    This research is to recognise the function of Building Information Modelling (BIM) in design optimization for irregular shaped buildings. The study focuses on a conceptual irregular shaped “twisted” building design similar to some existing sculpture-like architectures. Form and function are the two most important aspects of new buildings, which are becoming more sophisticated as parts of equally sophisticated “systems” that we are living in. Nowadays, it is common to have irregular shaped or sculpture-like buildings which are very different when compared to regular buildings. Construction industry stakeholders are facing stiff challenges in many aspects such as buildability, cost effectiveness, delivery time and facility management when dealing with irregular shaped building projects. Building Information Modelling (BIM) is being utilized to enable architects, engineers and constructors to gain improved visualization for irregular shaped buildings; this has a purpose of identifying critical issues before initiating physical construction work. In this study, three variations of design options differing in rotating angle: 30 degrees, 60 degrees and 90 degrees are created to conduct quantifiable comparisons. Discussions are focused on three major aspects including structural planning, usable building space, and structural constructability. This research concludes that Building Information Modelling is instrumental in facilitating design optimization for irregular shaped building. In the process of comparing different design variations, instead of just giving “yes or no” type of response, stakeholders can now easily visualize, evaluate and decide to achieve the right balance based on their own criteria. Therefore, construction project stakeholders are empowered with superior evaluation and decision making capability

    Extracting datums to reconstruct CSG models from 2D engineering sketches of polyhedral shapes

    Get PDF
    Our goal is to automatically generate CAD 3D models from 2D sketches as part of a design chain where models should be procedural, containing features arranged in a model tree and linked to suitable datums. Current procedural models capture much about the design intent and are easy to edit, but must be created from scratch during the detailed design state—given conceptual sketches as used by designers in the early part of the design process, current sketch-based modeling approaches only output explicit models. Thus, we describe an approach to extract high-level information directly from 2D engineering wireframe sketches and use it to complete a CSG feature tree, which serves as a model tree for a procedural 3D CAD model. Our method extracts procedural model information directly from 2D sketches in the form of a set of features, plus a set of datums and relationships between these features. We detect and analyze features of 2D sketches in isolation, and define the CSG feature tree by the parent–child relationships between features, and combine this information to obtain a complete and consistent CSG feature tree that can be transferred to a 3D modeler, which reconstructs the model. This paper focuses on how to extract the feature datums and the extrusion operation from an input 2D sketch.Funding for open access charge: CRUE-Universitat Jaume

    Visualizing Co-Phylogenetic Reconciliations

    Get PDF
    We introduce a hybrid metaphor for the visualization of the reconciliations of co-phylogenetic trees, that are mappings among the nodes of two trees. The typical application is the visualization of the co-evolution of hosts and parasites in biology. Our strategy combines a space-filling and a node-link approach. Differently from traditional methods, it guarantees an unambiguous and `downward' representation whenever the reconciliation is time-consistent (i.e., meaningful). We address the problem of the minimization of the number of crossings in the representation, by giving a characterization of planar instances and by establishing the complexity of the problem. Finally, we propose heuristics for computing representations with few crossings.Comment: This paper appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

    Passively Q-switched side pumped monolithic ring laser

    Get PDF
    Disclosed herein are systems and methods for generating a side-pumped passively Q-switched non-planar ring oscillator. The method introduces a laser into a cavity of a crystal, the cavity having a round-trip path formed by a reflection at a dielectrically coated front surface, a first internal reflection at a first side surface of the crystal at a non-orthogonal angle with the front, a second internal reflection at a top surface of the crystal, and a third internal reflection at a second side surface of the crystal at a non-orthogonal angle with the front. The method side pumps the laser at the top or bottom surface with a side pump diode array beam and generates an output laser emanating at a location on the front surface. The design can include additional internal reflections to increase interaction with the side pump. Waste heat may be removed by mounting the crystal to a heatsink

    New Approaches on Octilinear Graph Drawing

    Get PDF
    Graphenzeichnen ist ein Bereich der Informatik mit langer Tradition. Insbesondere im Bereich des orthogonalen Graphenzeichnens wird seit den 1980er Jahren motiviert durch VLSI-Design (Chip-Design) und Grundrissplanung intensiv geforscht. In dieser Arbeit wird das klassische orthogonale Modell durch neue Elemente, unter anderem aus dem oktilinearen Graphenzeichnen, erweitert. Die ersten Ergebnisse, die wir in dieser Arbeit vorstellen, befassen sich mit oktilinearem Graphenzeichnen. Dieses Modell ist altbekannt und viele Aspekte wurden schon untersucht. Wir entwickeln eine Methode mit der fĂŒr planare Graphen mit einem beschrĂ€nkten maximalen Knotengrad (4 und 5) Zeichnungen mit maximal einem Knick pro Kante erstellt werden können. Außerdem zeigen wir, dass Graphen mit maximalem Knotengrad 6 nicht immer mit einem Knick pro Kante gezeichnet werden können. Damit schließen wir die LĂŒcke zwischen bekannten Ergebnissen, die besagen dass Graphen mit maximalem Knotengrad 3 immer ohne Knicke und alle Graphen bis zu einem maximalen Knotengrad von 8 mit höchstens zwei Knicken pro Kante oktilinear gezeichnet werden können. Durch Nutzerstudien konnte gezeigt werden, dass die Lesbarkeit von (Graphen) Zeichnungen durch Knicke auf den Kanten und schlecht identifizierbare Kreuzungen besonders beeintrĂ€chtigt wird. An diesem Punkt setzt unser neues Modell, das abgeschrĂ€gt orthogonale (engl. slanted orthogonal, oder kurz: slog) Graphenzeichnen an. Im slog Modell ist der kleinste erlaubte Winkel zwischen zwei aufeinander folgenden Kantensegmenten 135°. Das hat zur Folge, dass slog Zeichnungen keine normalen Knicke mehr haben, sondern sogenannte Halb-Knicke. Um Kreuzungen besser erkennbar zu machen sind im slog Modell Kreuzungen ausschließlich zwischen diagonalen Segmenten erlaubt. Wir zeigen, dass eine knick-minimale slog Zeichnung mindestens doppelt so viele Halb-Knicke benötigt, wie eine knick-minimale orthogonale Zeichnung Knicke hat. FĂŒr das slog Modell werden in dieser Arbeit Methoden zur Berechnung von knick-minimalen Zeichnungen vorgestellt. Da diese exponentielle FlĂ€che benötigen können, wird außerdem eine Heuristik entwickelt, die nur quadratische Fl ̈ache benötigt, dafĂŒr aber mehr Knicke zulĂ€sst. Die Ergebnisse einer experimentellen Evaluation des slog Modells werden ebenfalls prĂ€sentiert. Im Anschluss erweitern wir das slog Modell zu einer flexibleren Variante die wir sloggy nennen. Das sloggy Modell hat alle Eigenschaften des slog Modells, aber Kreuzungen werden jetzt auch zwischen orthogonalen Segmenten erlaubt. DafĂŒr wird die Anzahl Halb-Knicke beschrĂ€nkt auf genau zwei Mal die Anzahl Knicke der entsprechenden knick-minimalen orthogonalen Zeichnung. Außerdem wird die Anzahl an Kreuzungen zwischen diagonalen Segmenten maximiert. Wir entwickeln eine Methode zur Berechnung solcher Zeichnungen und zeigen, dass auch hier exponentielle FlĂ€che benötigt werden kann. Das slog und das sloggy Modell sind auf Graphen mit einem maximalen Knotengrad von 4 beschrĂ€nkt. Deswegen wenden wir uns als nĂ€chstes dem Kandinsky Modell zu, einem bekannten Modell mit dem Graphen mit beliebigem Knotengrad gezeichnet werden können. Wir erweitern das bekannte Modell mit Elementen aus dem slog Modell, den Halb-Knicken, um so zuvor verbotene Konfigurationen zeichnen zu können. Mit unserer Erweiterung wollen wir die Gesamtzahl an Knicken und die GrĂ¶ĂŸe der Zeichnungen verkleinern. Wir entwickeln eine LP Formulierung, mit der die optimale Zeichnung berechnet werden kann. Da diese sehr lange Zeit zur Berechnung beanspruchen kann, haben wir zusĂ€tzliche eine effiziente Heuristik entwickelt. In einer experimentellen Untersuchung vergleichen wir außerdem das neue Modell mit dem klassischen Kandinsky Modell. Im letzten Kapitel vereinen wir dann unsere Modifikation des Kandinsky Modells mit dem slog Modell im sogenannten sloginsky Modell, um Graphen mit beliebigem Knotengrad mit den Vorteilen des slog Modells zeichnen zu können. Wir entwickeln eine Methode zur Berechnung knick-optimaler sloginsky Zeichnungen, aber wir zeigen auch, dass eine solche Zeichnung nicht fĂŒr jede Eingabe möglich ist. Auch im sloginsky Modell kann eine Zeichnung exponentielle FlĂ€che beanspruchen, was in der experimentellen Evaluation ebenfalls sichtbar wird

    SYSTEM AND METHOD FOR FABRICATING POLARIZATION SELECTIVE ELEMENT

    Get PDF
    A system includes a surface relief grating configured to forwardly diffract an input beam as two linearly polarized beams. The system also includes a waveplate optically coupled with the surface relief grating and configured to convert the two linearly polarized beams into two circularly polarized beams having orthogonal circular polarizations. The two circularly polarized beams having orthogonal circular polarizations interfere with one another to generate a polarization interference pattern

    Device for vitrectomy surgical operations

    Get PDF
    A vitrectomy probe for removing vitreous material from an eyeball, having a longitudinal axis and an outer tube with a closed end and a lateral surface, at least one inlet port located proximate to the closed end and configured to allow the vitreous material to enter into the outer tube; an inner tube arranged in the outer tube to relatively move with respect to the outer tube, the inner tube having an opening with a cutting profile through which the vitreous material can be cut and can enter the inner tube, a drive unit configured for causing the outer tube and the inner tube to move relatively with respect to each other, in such a way that the cutting profile cuts the vitreous material entering the inlet port

    On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs

    Get PDF
    An orthogonal drawing of a graph is a planar drawing where each edge is drawn as a sequence of horizontal and vertical line segments. Finding a bend-minimized orthogonal drawing of a planar graph of maximum degree 4 is NP-hard. The problem becomes tractable for planar graphs of maximum degree 3, and the fastest known algorithm takes O(n^5 log n) time. Whether a faster algorithm exists has been a long-standing open problem in graph drawing. In this paper we present an algorithm that takes only O~(n^{17/7}) time, which is a significant improvement over the previous state of the art
    • 

    corecore