作者: 不能和解 時(shí)間: 2025-3-21 22:01 作者: chisel 時(shí)間: 2025-3-22 04:25
https://doi.org/10.1007/978-94-009-5055-9This paper reports on preference experiments assessing the effect of individual aesthetics in the application domain of UML diagrams, resulting in a priority listing of aesthetics for this domain. The results reveal a difference in aesthetic priority from those of previous domain-independent experiments.作者: Glutinous 時(shí)間: 2025-3-22 07:55 作者: 宣傳 時(shí)間: 2025-3-22 11:39
Microplastics Pollution and its Remediationute a 2D layout of a sparse graph in around 30 seconds for a 10,000 vertex graph to around 10 minutes for the largest graph. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.作者: 泥瓦匠 時(shí)間: 2025-3-22 16:39 作者: 泥瓦匠 時(shí)間: 2025-3-22 20:55
User Preference of Graph Layout Aesthetics: A UML StudyThis paper reports on preference experiments assessing the effect of individual aesthetics in the application domain of UML diagrams, resulting in a priority listing of aesthetics for this domain. The results reveal a difference in aesthetic priority from those of previous domain-independent experiments.作者: vasospasm 時(shí)間: 2025-3-22 22:30 作者: Stress 時(shí)間: 2025-3-23 05:19 作者: defendant 時(shí)間: 2025-3-23 07:24 作者: AROMA 時(shí)間: 2025-3-23 09:51
Microorganisms in Environmental Managementin conveying some of the information needed by the human operator to steer the computation effectively, and suggest that interactive, human-guided search may be a useful alternative to fully automatic methods for network and graph partitioning.作者: excursion 時(shí)間: 2025-3-23 15:24
Francesca Cappitelli,Federica VillaL for a fixed scaling factor ., and an .((. + .) log.(. + .)) time algorithm to find the largest feasible scaling factor ., where . is the number of points and . is the number of edges of polygonal obstacles.作者: antidote 時(shí)間: 2025-3-23 22:06 作者: Curmudgeon 時(shí)間: 2025-3-23 23:17
Hans R. Pruppacher,James D. Kletthical decomposition of states into substates; they have a low number of edge crossings; they have good aspect ratio; and require a small area. We have implemented our framework and obtained drawings for several statechart examples. The preliminary drawings are very encouraging.作者: Reverie 時(shí)間: 2025-3-24 04:44
https://doi.org/10.1007/978-3-031-54565-8e for drawing graphs, which was motivated by the recently published multi-scale algorithm of Hadany and Harel [.]. It can significantly improve the speed of essentially any force-directed method (regardless of that method’s ability of drawing weighted graphs or the continuity of its cost-function).作者: 裂縫 時(shí)間: 2025-3-24 07:37 作者: 過分 時(shí)間: 2025-3-24 13:36 作者: Antagonist 時(shí)間: 2025-3-24 17:34
2,-Structure Drawings of Similar Moleculesompute a structure called supertree in which all molecules can be embedded. Using the correspondences between atoms provided by the supertree, we are able to coordinate the drawings performed by a breadth-first traversal of the molecular graphs. Both parts of the problem are NP-hard. We propose algorithms of heuristic nature.作者: interlude 時(shí)間: 2025-3-24 19:51 作者: Urgency 時(shí)間: 2025-3-25 00:04
A Fast Multi-scale Method for Drawing Large Graphse for drawing graphs, which was motivated by the recently published multi-scale algorithm of Hadany and Harel [.]. It can significantly improve the speed of essentially any force-directed method (regardless of that method’s ability of drawing weighted graphs or the continuity of its cost-function).作者: 媒介 時(shí)間: 2025-3-25 04:38 作者: 步履蹣跚 時(shí)間: 2025-3-25 08:30 作者: AFFIX 時(shí)間: 2025-3-25 14:36
Selection and Use of Acceptance Criteria,rformance evaluation in terms of quality and running time. The test data consists of two test-suites already used in previous experimental research. In order to get hard instances, we randomly generated an additional set of planar graphs.作者: 徹底明白 時(shí)間: 2025-3-25 16:20 作者: STIT 時(shí)間: 2025-3-25 20:57 作者: 任命 時(shí)間: 2025-3-26 02:35 作者: 全部逛商店 時(shí)間: 2025-3-26 04:47
The Visual Representation of Information Structures four case studies. (1) How can we design a graph so that paths can be discerned? Recent results in the perception of contours can be applied to make paths easier to perceive in directed graphs. (2) Should we be displaying graphs in 3D or 2D space? Research suggests that larger graphs can be underst作者: circuit 時(shí)間: 2025-3-26 09:33 作者: calamity 時(shí)間: 2025-3-26 15:09 作者: 錢財(cái) 時(shí)間: 2025-3-26 19:32 作者: CROW 時(shí)間: 2025-3-26 21:27
An Experimental Comparison of Orthogonal Compaction Algorithms orthogonal drawing, the task is to place the vertices and the bends on grid points so that the total area or the total edge length is minimised. We compare four constructive heuristics based on rectangular dissection and on turn-regularity, also in combination with two improvement heuristics based 作者: 口味 時(shí)間: 2025-3-27 04:43 作者: nettle 時(shí)間: 2025-3-27 05:33 作者: 積習(xí)已深 時(shí)間: 2025-3-27 10:29
A Linear Time Implementation of SPQR-Treesroduced by Di Battista and Tamassia [.] and, since then, became quite important in the field of graph algorithms. Theoretical papers using SPQR-trees claim that they can be implemented in linear time using a modification of the algorithm by Hopcroft and Tarjan [.] for decomposing a graph into its tr作者: consolidate 時(shí)間: 2025-3-27 14:27 作者: GLOOM 時(shí)間: 2025-3-27 20:57 作者: CHASM 時(shí)間: 2025-3-27 22:19 作者: 饒舌的人 時(shí)間: 2025-3-28 04:27
Fast Layout Methods for Timetable Graphsy, but due to small angles and overlaps, not all edges should be represented by geodesics (straight lines or great circles)..A previously introduced algorithm represents a subset of the edges by Bézier curves, and places control points of these curves using a force- directed approach [.]. While the 作者: 貝雷帽 時(shí)間: 2025-3-28 07:11
An Algorithmic Framework for Visualizing Statechartstion of layouts of statechart diagrams. Our framework is based on several techniques that include hierarchical drawing, labeling, and floorplanning, designed to work in a cooperative environment. Therefore, the resulting drawings enjoy several important properties: they emphasize the natural hierarc作者: 搖曳的微光 時(shí)間: 2025-3-28 10:50 作者: 油氈 時(shí)間: 2025-3-28 16:00 作者: wall-stress 時(shí)間: 2025-3-28 20:47 作者: CULP 時(shí)間: 2025-3-29 01:19
A Fast Multi-scale Method for Drawing Large Graphsd is capable of drawing graphs of substantially larger size than any other algorithm we are aware of. For example, the algorithm achieves optimal drawings of 1000 vertex graphs in about 2 seconds. The paper contains graphs with over 6000 nodes. The proposed algorithm embodies a new multi-scale schem作者: 食料 時(shí)間: 2025-3-29 05:38
FADE: Graph Drawing, Clustering, and Visual Abstractionsion of the Barnes-Hut hierarchical space decomposition method, which includes edges and multilevel visual abstraction. Compared to the original force directed algorithm, the time overhead is .(. + . log .) where . and . are the numbers of nodes and edges. The improvement is possible since the decom作者: 世俗 時(shí)間: 2025-3-29 11:14 作者: 先兆 時(shí)間: 2025-3-29 12:22 作者: Goblet-Cells 時(shí)間: 2025-3-29 18:05 作者: 迎合 時(shí)間: 2025-3-29 23:30
Microorganisms in Environmental Management better partitioning. In our system the user is presented with a drawing of a current network partitioning, and is responsible for choosing appropriate optimization procedures and for focusing their application on portions of the network. Our pilot experiments show that our network drawings succeed 作者: 強(qiáng)制性 時(shí)間: 2025-3-30 01:38 作者: podiatrist 時(shí)間: 2025-3-30 07:20
https://doi.org/10.1007/978-1-4419-9374-8 and rich features of XML make it possible to define an interchange format that not only supports the pure, mathematical description of a graph, but also the needs of information visualization applications that use graph-based data structures.作者: 喃喃訴苦 時(shí)間: 2025-3-30 09:30 作者: FOR 時(shí)間: 2025-3-30 16:07
K. Rinu,Anita Pandey,Lok Man S. Palniroduced by Di Battista and Tamassia [.] and, since then, became quite important in the field of graph algorithms. Theoretical papers using SPQR-trees claim that they can be implemented in linear time using a modification of the algorithm by Hopcroft and Tarjan [.] for decomposing a graph into its tr作者: 變形 時(shí)間: 2025-3-30 18:00
Francesca Cappitelli,Federica Villae label for each point is selected from a set of rectangles with various shapes satisfying the . property, and is placed near to the point after scaled by a scaling factor . which is common to all points. In this paper, we give an optimal .((.+.) log(.+ .)) algorithm to decide the feasibility of LOF作者: Libido 時(shí)間: 2025-3-30 20:41
Microorganisms to Combat Pollutionn a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. We present an algorithm for c-planar orthogonal drawings of hierarchically clustered planar graphs with rectangularly shaped cluster boundaries and the作者: Cocker 時(shí)間: 2025-3-31 00:56
Pratul Kumar Saraswati,M. S. Srinivasancture drawings. To simplify the chemists’ task, the drawings should reveal similarities and differences between drugs. Given a family of molecules all containing a common template, we present an algorithm to compute standardised 2. structure drawings. The molecules being represented as a graph, we c作者: Axon895 時(shí)間: 2025-3-31 07:33 作者: Alveolar-Bone 時(shí)間: 2025-3-31 12:16
Hans R. Pruppacher,James D. Kletttion of layouts of statechart diagrams. Our framework is based on several techniques that include hierarchical drawing, labeling, and floorplanning, designed to work in a cooperative environment. Therefore, the resulting drawings enjoy several important properties: they emphasize the natural hierarc作者: 巨碩 時(shí)間: 2025-3-31 15:34 作者: 開始從未 時(shí)間: 2025-3-31 19:01 作者: Cpap155 時(shí)間: 2025-3-31 23:20
Microplastics Pollution and its Remediation process groups vertices to form ., uses the clusters to define a new graph and is repeated until the graph size falls below some threshold. The coarsest graph is then given an initial layout and the layout is successively refined on all the graphs starting with the coarsest and ending with the orig作者: 迅速成長 時(shí)間: 2025-4-1 03:03
https://doi.org/10.1007/978-3-031-54565-8d is capable of drawing graphs of substantially larger size than any other algorithm we are aware of. For example, the algorithm achieves optimal drawings of 1000 vertex graphs in about 2 seconds. The paper contains graphs with over 6000 nodes. The proposed algorithm embodies a new multi-scale schem作者: 盡忠 時(shí)間: 2025-4-1 07:20
The Impact of the Cultural Revolution,sion of the Barnes-Hut hierarchical space decomposition method, which includes edges and multilevel visual abstraction. Compared to the original force directed algorithm, the time overhead is .(. + . log .) where . and . are the numbers of nodes and edges. The improvement is possible since the decom作者: fluoroscopy 時(shí)間: 2025-4-1 10:57
Graph Drawing978-3-540-44541-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 油膏 時(shí)間: 2025-4-1 14:52
Amidases of Pseudomonas aeruginosa,ng of large sets of graphs. This paper builds on our previous work [.] by defining some additional similarity measures, refining some existing ones, and presenting the results of a user study designed to evaluate the suitability of the measures.作者: Protein 時(shí)間: 2025-4-1 19:06 作者: 常到 時(shí)間: 2025-4-2 01:59
