A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
[article]
2018
arXiv
pre-print
Preserved Fulltext
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. ...
Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and interpret a drawing of a graph. ...
The authors would also like to acknowledge Simon Wegendt and Jessica Wolz for implementing the first version of our prototype. ...
arXiv:1808.10519v1
fatcat:i7kqiedskvh7xkg2sfft5lio6i
The Aesthetics of Graph Visualization
[article]
2007
Computational Aesthetics in Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We summarize this in a framework that outlines graph drawing heuristics, their perceptual basis, and evaluation status. ...
A variety of aesthetic heuristics have been proposed, with the assumption that these will improve readability and understanding. ...
The majority of these, such as those dealing with edge crossings, graph width, and node orthogonality, are covered by general graph drawing heuristics. ...
doi:10.2312/compaesth/compaesth07/057-064
fatcat:m2hj565ayfam3i4wyt7us5viye
Graph drawing
[chapter]
2004
Handbook of Discrete and Computational Geometry, Second Edition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Finding the minimum number of crossings or a maximum planar subgraph are NP-hard problems. Hence, existing planarization algorithms use heuristics. ...
If the graph is nonplanar, it is transformed into a planar graph by means of a preliminary planarization step that replaces each crossing with a ctitious vertex. ...
doi:10.1201/9781420035315.ch52
fatcat:suzr5ked2veg7pmtmgpfppvrua
A new biclustering technique based on crossing minimization
2006
Neurocomputing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, a new graph theoretic, crossing minimization based biclustering technique is proposed. ...
The performance of the proposed technique is compared with a recently reported classical biclustering technique of Cheng & Church [4] demonstrating notably better results. ...
The effect of white noise is demonstrated in Figure- Let G + B denote the isomorphic graph as a result of using Crossing Minimization Heuristic (CMH) on G B and the corresponding bi-graph drawing be ...
doi:10.1016/j.neucom.2006.02.018
fatcat:plpguhf3fvgnzh3ss5n4dsyvse
Algorithms for drawing graphs: an annotated bibliography
1994
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. ...
Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. ...
Acknowledgements The authors wish to thank the many graph drawers who have pointed out errors and omissions in the first three versions, and those who have helped with updates to create this fourth version ...
doi:10.1016/0925-7721(94)00014-x
fatcat:rwudrni2evgkle42lecplbjhle
Design of a computer tool for the optimization of solid waste collection circuits
2020
E3S Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
And concluded with an effective method on which will be based the design of a computer optimization tool. ...
The optimization of solid waste collection circuits is one of the applications of the Capacited Arc Routing Problem. ...
They developed two ant colony approaches: a hybrid approach with two steps : optimizing the order of tasks for insertion by optimizing ant colonies and insertion of tasks by a heuristic backup method. ...
doi:10.1051/e3sconf/202015002016
fatcat:qdybaqxew5dmnhd5ciie66z2iu
A Dynamic Multiscale Magnifying Tool for Exploring Large Sparse Graphs
2008
Information Visualization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
GreenMax uses a highly effective multilevel graph drawing approach to pre-process a large graph by generating a hierarchy of increasingly coarse layouts that later support the dynamic zooming of the graph ...
We present an information visualization tool, known as GreenMax, to visually explore large small-world graphs with up to a million graph nodes on a desktop computer. ...
Department of Energy by Battelle Memorial Institute under Contract DE-AC05-76RL01830. ...
doi:10.1057/palgrave.ivs.9500177
fatcat:7ylcrumlgvbzbn6u4hra7woykq
Clustered edge routing
2015
2015 IEEE Pacific Visualization Symposium (PacificVis)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
ABSTRACT The classic method to depict graphs is a node-link diagram where vertices (nodes) are associated with each object and edges (links) connect related objects. ...
Figure 1 : Clustered edge routing based on a well-separated pair decomposition and a greedy sparsification of the visibility graph on a synthetic data set. One edge cluster is highlighted in red. ...
We use a snapping heuristic to move the Voronoi vertices towards each other or towards the hull vertices (see Fig. 3 (c)). ...
doi:10.1109/pacificvis.2015.7156356
dblp:conf/apvis/BoutsS15
fatcat:ylxmtg6ogzdw7pkpjcav4qmfse
Generalized Layerings for Arbitrary and Fixed Drawing Areas
2017
Journal of Graph Algorithms and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The Directed Layering Problem (DLP) solves a step of the widely used layer-based approach to automatically draw directed acyclic graphs. ...
We present an integer programming model and a heuristic to solve the NP-complete GLP and perform thorough evaluations on different sets of graphs and with different implementations for the steps of the ...
Test Graphs. Our new approach is intended to improve the drawings of graphs with a large height and relatively small width, hence unfavorable aspect ratio. ...
doi:10.7155/jgaa.00441
fatcat:3nzrzvctozazxp6yl6eynvwczq
Parsing Architecture within Plan Drawings with Application to Medieval Castles and Fortresses
[article]
2009
VAST: International Symposium on Virtual Reality
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We demonstrate the utility of this approach by parsing several plan drawings of medieval castles and fortresses and generating 3D reconstructions of these structures and detail typical circumstances that ...
This paper discusses an algorithm that estimates the geometry and semantic interpretation of architectural structures from a plan drawing. ...
Towards this end, we fit a linear curve model and a circular arc curve model to the sequence of points. ...
doi:10.2312/vast/vast09/017-024
fatcat:myzytfqo4bgonfu2kdlv43m34y
Edge Compression Techniques for Visualization of Dense Directed Graphs
2013
IEEE Transactions on Visualization and Computer Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
a) A standard "flat" node-link diagram of a graph with 23 directed edges. ...
(d) A Power-Graph Decomposition further relaxes the definition of a module to allow edges to cross module boundaries, allowing the same graph to be drawn with only 7 edges. Fig. 1. ...
When choosing a destination for the edge in (a) or (b), the choice is weighted towards nodes that have a high in-degree, and when choosing an origin for the edge in (b) or (c), the choice is weighted towards ...
doi:10.1109/tvcg.2013.151
pmid:24051826
fatcat:bjmkimbll5cjzmd7wfsaf2qtbm
RoadTracer: Automatic Extraction of Road Networks from Aerial Images
2018
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
High-resolution aerial imagery provides a promising avenue to automatically infer a road network. ...
We compare our approach with a segmentation method on fifteen cities, and find that at a 5% error rate, RoadTracer correctly captures 45% more junctions across these cities. ...
To evaluate our approach, we assemble a large corpus of high-resolution satellite imagery and ground truth road network graphs covering the urban core of forty cities across six countries. ...
doi:10.1109/cvpr.2018.00496
dblp:conf/cvpr/BastaniHAABCMD18
fatcat:t6sum6ydrzdp5frkdo5e4tlc3i
Improving multiple aesthetics produces better graph drawings
2013
Journal of Visual Languages and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Many automatic graph drawing algorithms implement only one or two aesthetic criteria since most aesthetics conflict with each other. ...
The comparable effectiveness raises a question about the necessity of choosing one algorithm against another for drawing graphs when human performance is a main concern. ...
As a result, a number of algorithms take a heuristic approach by which the aesthetic in consideration is not necessarily optimized in the resulting drawings. ...
doi:10.1016/j.jvlc.2011.12.002
fatcat:6yknmoprqzehjnjpqubtzuwev4
RoadTracer: Automatic Extraction of Road Networks from Aerial Images
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
High-resolution aerial imagery provides a promising avenue to automatically infer a road network. ...
We compare our approach with a segmentation method on fifteen cities, and find that at a 5% error rate, RoadTracer correctly captures 45% more junctions across these cities. ...
To evaluate our approach, we assemble a large corpus of high-resolution satellite imagery and ground truth road network graphs covering the urban core of forty cities across six countries. ...
arXiv:1802.03680v2
fatcat:gmugr6yqlbfrbpbwji4fzdm6ei
A spectral image clustering algorithm based on ant colony optimization
2012
Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XVIII
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The algorithm does this through identification of a series of one dimensional manifolds on the spectral data cloud via the ACO approach, and then associates pixels to these paths based on their spectral ...
The ACO algorithm uses virtual ants to create candidate solutions that are represented by paths on a mathematical graph. ...
The algorithm has been applied to a high resolution multispectral image collected with the Worldview-2 platform. ...
doi:10.1117/12.919082
fatcat:3zzhgtq2znby7dxmimixexmyvq
« Previous
Showing results 1 — 15 out of 11,211 results