نتایج جستجو برای: limiting drawing ratio

تعداد نتایج: 624982  

The size and length effects of an inclusion on multi-pass copper shaped-wire drawing were investigated. For this purpose, an experimental investigation on optimal die half-angle was conducted. Based on experimental data of optimal die half-angle, wire and inclusion deformations, drawing and hydrostatic stress of copper shaped-wires that contain an inclusion were calculated by two-dimensional fi...

Journal: :Comput. Geom. 1998
Giuseppe Liotta Anna Lubiw Henk Meijer Sue Whitesides

A proximity drawing of a graph is a straight-line drawing where adjacent vertices are represented by points that are deemed to be close according to some proximity measure. A rectangle of innuence drawing is a proximity drawing where the measure is based on the concept of rectangle of innuence. Given two points u and v, the rectangle of innuence of u and v is the axis-aligned rectangle having u...

1999
David R. Wood

In this paper we investigate the general position model for the drawing of arbitrary degree graphs in the D-dimensional (D ≥ 2) orthogonal grid. In this model no two vertices lie in the same grid hyperplane. We show that for D ≥ 3, given an arbitrary layout and initial edge routing a crossing-free orthogonal drawing can be determined. We distinguish two types of algorithms. Our layout-based alg...

2003
Christine Alvarado

People sketch to express their early design ideas in many domains, but current computer tools offer few advantages to designers during this sketching phase. Our goal is to construct a general recognition architecture that can be applied to a number of domains that is capable of parsing the user’s strokes (in real time) and interpreting them as depicting objects in the domain of interest without...

2004
Peter J Wild Peter Johnson

The paper argues that task and work modelling approaches take a shallow view of time that is both limited in the relationships between subgoals are relative, in that task models are not grounded in the temporal patterns of work. In the light of Hall’s theory of mono-chronic and polychromic time cultures this is a weakness that is both culturally biased and limiting. Drawing on a synthesis of a ...

1996
Giuseppe Di Battista Ashim Garg Giuseppe Liotta Armando Parise Roberto Tamassia Emanuele Tassinari Francesco Vargiu Luca Vismara

In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an experimental study on four drawing algorithms speciically developed for DAGs. Our study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and...

2014
Carsten Gutwenger Ulf Rüegg Miro Spönemann Reinhard von Hanxleden Petra Mutzel

Graph drawing algorithms have important practical applications, e. g. layer-based algorithms for data flow diagram layout in embedded software design and planarization-based algorithms to layout UML diagrams in software engineering. Most current drawing methods focus on the optimization of aesthetic criteria such as the number of edge crossings and bends. The aspects of compactness and aspect r...

2000
Dan Yan Polina Galkin Sanzheng Qiao

Global Meeting Plus (GMP) is a Web-based collaborative GroupWare application, which consists of chat-channel, whiteboard, database, communication security, and pillow-talking. The chat-channel is for talking, whiteboard for drawing, database for recording, communication security for avoiding the information leaking out, and the pillowtalking for limiting meeting team. GMP can be used to hold an...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید