Filters








1,188 Hits in 4.4 sec

Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size [chapter]

Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
1999 Lecture Notes in Computer Science  
We consider the problem of computing orthogonal drawings and quasi-upward drawings with vertices of prescribed size.  ...  For both types of drawings we present algorithms based on network flow techniques and show that the produced drawings are optimal within a wide class.  ...  planar drawings of digraphs with vertices of prescribed size (Section 5).  ... 
doi:10.1007/3-540-46648-7_31 fatcat:uoadhszk6rgh3e7n6pqlss2nja

Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size [chapter]

Markus Eiglsperger, Michael Kaufmann
2002 Lecture Notes in Computer Science  
In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input.  ...  It has linear worst case running time and experiments show that it performs very well in practice.  ...  Find a drawing Γ of G with quasi-orthogonal representation Q, in which the vertices of G are represented as points.  ... 
doi:10.1007/3-540-45848-4_11 fatcat:22fc7zu5vfewfh7lcwq6zbxxpy

More Compact Orthogonal Drawings by Allowing Additional Bends †

Michael Jünger, Petra Mutzel, Christiane Spisla
2018 Information  
Compacting orthogonal drawings is a challenging task. Usually, algorithms try to compute drawings with small area or total edge length while preserving the underlying orthogonal shape.  ...  We suggest a moderate relaxation of the orthogonal compaction problem, namely the one-dimensional monotone flexible edge compaction problem with fixed vertex star geometry.  ...  We also gratefully acknowledge helpful discussions with Martin Gronemann, Sven Mallach, and Daniel Schmidt. Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/info9070153 fatcat:xbde4dxcorfqph7z4qiypco6uq

A topology-shape-metrics approach for the automatic layout of UML class diagrams

Markus Eiglsperger, Michael Kaufmann, Martin Siebenhaller
2003 Proceedings of the 2003 ACM symposium on Software visualization - SoftVis '03  
These algorithms produce good results for class diagrams with large and deep structural information, i.e., diagrams with a large and deep inheritance hierarchy.  ...  Current approaches for the automatic layout of class diagrams are based on the hierarchic graph drawing paradigm.  ...  In [Bertolazzi et al. 2002 ] a topology-shapemetrics approach for quasi-upward drawings with a minimal number of non-upward pointing edges is described.  ... 
doi:10.1145/774856.774860 fatcat:f2nfmfdqa5a6rbluispv3t6vja

A topology-shape-metrics approach for the automatic layout of UML class diagrams

Markus Eiglsperger, Michael Kaufmann, Martin Siebenhaller
2003 Proceedings of the 2003 ACM symposium on Software visualization - SoftVis '03  
These algorithms produce good results for class diagrams with large and deep structural information, i.e., diagrams with a large and deep inheritance hierarchy.  ...  Current approaches for the automatic layout of class diagrams are based on the hierarchic graph drawing paradigm.  ...  In [Bertolazzi et al. 2002 ] a topology-shapemetrics approach for quasi-upward drawings with a minimal number of non-upward pointing edges is described.  ... 
doi:10.1145/774833.774860 dblp:conf/softvis/EiglspergerKS03 fatcat:rs3rbvzlkzewxj5dievscqd6ja

Page 2771 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
Orthogonal and quasi-upward drawings with vertices of prescribed size (extended abstract) (297-310); David R.  ...  Wood, Multi-dimensional orthogonal graph drawing with small boxes (extended abstract) (311-322); Patrice Ossona de Mendez, Geometric realization of simplicial complexes (324-332); Robert Babilon, Helena  ... 

A Survey on Graph Drawing Beyond Planarity [article]

Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
2018 arXiv   pre-print
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configurations.  ...  Aim of this survey is to describe the main research directions in this area, the most prominent known results, and some of the most challenging open problems.  ...  A well-known result is that a universal point set of size n that supports straight-line crossing-free drawings of all planar graphs with n vertices does not exist [81] .  ... 
arXiv:1804.07257v1 fatcat:xeckxilhfbbgdbfhctikymlq6m

A Combinatorial Approach to Orthogonal Placement Problems [chapter]

Gunnar W. Klau
2003 Operations Research Proceedings 2002  
Compaction problems are concerned with performing the conversion from a dimensionless description of the orthogonal shape of a graph to an area-efficient drawing in the orthogonal grid with short edges  ...  We study two families of NP -hard orthogonal placement problems that arise in the area of information visualization both from a theoretical and a practical point of view.  ...  Among the most important models in practice are those which are able to cope with vertices of prescribed size.  ... 
doi:10.1007/978-3-642-55537-4_4 dblp:conf/or/Klau02 fatcat:jgxvmhcijbdibafixism7iami4

Windrose Planarity: Embedding Graphs with Direction-Constrained Edges

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2015 Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms  
By exploiting both the horizontal and the vertical relationship among vertices, windrose-planar drawings allow to simultaneously visualize two partial orders defined by means of the edges of the graph.  ...  v, (iv) each neighbor u ∈ v is below and to the right of v, and (v) edges are represented by curves that are monotone with respect to each axis.  ...  First, we give an algorithm to construct windrose-planar drawings of windrose-planar graphs with at most one bend per edge, and whose vertices and bends lie on a polynomial-size grid (Section 4); we remark  ... 
doi:10.1137/1.9781611974331.ch70 dblp:conf/soda/AngeliniLBDKRR16 fatcat:7ygvfgd2pjej7acgjutjfhpzvq

Windrose Planarity

Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter
2018 ACM Transactions on Algorithms  
Furthermore, for any embedded graph with n vertices that has a windrose-planar drawing, we can construct one with at most one bend per edge and with at most 2n-5 bends in total, which lies on the 3n ×  ...  By exploiting both the horizontal and the vertical relationship among vertices, windrose-planar drawings allow to simultaneously visualize two partial orders defined by means of the edges of the graph.  ...  First, we give an algorithm to construct windrose-planar drawings of windrose-planar graphs with at most one bend per edge, and whose vertices and bends lie on a polynomial-size grid (Section 4); we remark  ... 
doi:10.1145/3239561 fatcat:m4ys24l7szcfha5ckrbencenca

Large-eddy simulation of turbulent flows over an urban building array with the ABLE-LBM and comparison with 3D MRI observed data sets

Yansen Wang, Michael J. Benson
2020 Environmental Fluid Mechanics  
The model produced horizontal and vertical fields of time-averaged velocity fields and compared well with the experimental results.  ...  The building set-up was an evenly spaced orthogonal array of cubic buildings (height = H) with a central tall building (height = 3H) in the second row.  ...  The buildings are a uniformly spaced orthogonal array of cubic buildings with height and spacing of H with a central tall building of height 3H.  ... 
doi:10.1007/s10652-020-09770-6 fatcat:ybpu252qs5fevk7xlfk5fkyx3y

A Large-Eddy Simulation Study of Thermal Effects on Turbulent Flow and Dispersion in and above a Street Canyon

Seung-Bu Park, Jong-Jin Baik, Siegfried Raasch, Marcus Oliver Letzel
2012 Journal of Applied Meteorology and Climatology  
By contrast, in the case with street-bottom and downwind building-wall heating, the frequency of sweep events is similar to that of ejection events and the contribution of ejection events to turbulent  ...  Thermal effects on turbulent flow and dispersion in and above an idealized street canyon with a street aspect ratio of 1 are numerically investigated using the parallelized large-eddy simulation model  ...  This work was supported by a National Research Foundation of Korea (NRF) grant funded by the South Korean government (MEST) (2011-0017041) and by the Brain Korea 21 Project (through the School of Earth  ... 
doi:10.1175/jamc-d-11-0180.1 fatcat:tw4l7wwjdfahdaex7ejupoimai

On the existence of the logarithmic surface layer in the inner core of hurricanes

Roger K. Smith, Michael T. Montgomery
2013 Quarterly Journal of the Royal Meteorological Society  
Finally, we draw attention to a study examining a range of boundary-layer schemes demonstrating that a recently articulated boundary-layer spin-up mechanism transcends the presence of a log layer.  ...  drag coefficient at high wind speeds and laying bare suggestions that hurricane models using boundarylayer schemes that do not represent the log layer should not be used.  ...  (2010) , they effectively prescribe the tangential wind at the top of the boundary layer where the flow is upwards.  ... 
doi:10.1002/qj.2121 fatcat:2su4oiioxvdghmktvqc725byhu

Bubble pinch-off in turbulence

Daniel J. Ruth, Wouter Mostert, Stéphane Perrard, Luc Deike
2019 Proceedings of the National Academy of Sciences of the United States of America  
We show that the average neck size, d¯, can be described by d¯∼(t−t0)α, where t0 is the pinch-off or singularity time and α≈0.5, in close agreement with the axisymmetric theory with no initial flow.  ...  of escaping the self-similar process and the time and length scale at which it occurs.  ...  This work was supported by NSF Faculty Early Career Development (CAREER) Program Award Chemical, Bioengineering, Environmental and Transport Systems (CBET) 1844932 and American Chemical Society Petroleum  ... 
doi:10.1073/pnas.1909842116 pmid:31792186 pmcid:PMC6926068 fatcat:bgpiau74jvgfvamo2cdu2pc6ta

Teleconnections of the quasi‐biennial oscillation in a multi‐model ensemble of QBO ‐resolving models

James A. Anstey, Isla R. Simpson, Jadwiga H. Richter, Hiroaki Naoe, Masakazu Taguchi, Federico Serva, Lesley J. Gray, Neal Butchart, Kevin Hamilton, Scott Osprey, Omar Bellprat, Peter Braesicke (+17 others)
2021 Quarterly Journal of the Royal Meteorological Society  
The Quasi-biennial Oscillation (QBO) dominates the interannual variability of the tropical stratosphere and influences other regions of the atmosphere.  ...  During Northern Hemisphere winter, the stratospheric polar vortex in most of these models strengthens when the QBO near 50 hPa is westerly and weakens when it is easterly, consistent with, but weaker than  ...  This work was supported by the National Center for The authors declare no conflicts of interest. ORCID  ... 
doi:10.1002/qj.4048 fatcat:fgon5y77vrhvvgp3czewtzvdvm
« Previous Showing results 1 — 15 out of 1,188 results