Algorithms for cartographic visualization
暂无分享,去创建一个
[1] E. Raisz. The Rectangular Statistical Cartogram , 1934 .
[2] G. Birkhoff. Rings of sets , 1937 .
[3] G. Birkhoff,et al. A ternary operation in distributive lattices , 1947 .
[4] Peter Ungar. On Diagrams Representing Maps , 1953 .
[5] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[6] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[7] A. Tucker,et al. Coloring a Family of Circular Arcs , 1975 .
[8] Toshihide Ibaraki,et al. A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..
[9] Daniel G. Cole,et al. OVERLAPPING GRADUATED CIRCLES / MAGNITUDE ESTIMATION AND METHOD OF PORTRAYAL , 1978 .
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.
[12] Robert E. Tarjan,et al. Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..
[13] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[14] A. Robinson. Early Thematic Mapping in the History of Cartography , 1982 .
[15] Richard Cole,et al. River Routing Every Which Way, but Loose (Extended Abstract) , 1984, FOCS.
[16] J B Schneider,et al. Using computer graphics to map origin-destination data describing health care delivery systems. , 1984, Social science & medicine.
[17] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[18] Edwin Kinnen,et al. Rectangular duals of planar graphs , 1985, Networks.
[19] Charles J. Colbourn,et al. Minimizing setups in ordered sets of fixed width , 1985 .
[20] Charles E. Leiserson,et al. Algorithms for routing and testing routability of planar VLSI layouts , 1985, STOC '85.
[21] Waldo R. Tobler,et al. Experiments In Migration Mapping By Computer , 1987 .
[22] I Rinsma. Nonexistence of a Certain Rectangular Floorplan with Specified Areas and Adjacency , 1987 .
[23] Kurt Mehlhorn,et al. On continuous Homotopic one layer routing , 1988, SCG '88.
[24] I. Rinsma. Rectangular and Orthogonal Floorplans with Required Room Areas and Tree Adjacency , 1988 .
[25] Israel Koren,et al. Floorplans, planar graphs and layouts , 1988 .
[26] F. Miller Maley. Single-layer wire routing and compaction , 1989, Foundations of computing.
[27] W.-K. Chen,et al. Generation of rectangular duals of a planar triangulated graph by elementary transformations , 1990, IEEE International Symposium on Circuits and Systems.
[28] Baruch Awerbuch,et al. Cost-sensitive analysis of communication protocols , 1990, PODC '90.
[29] Jeffrey S. Torguson,et al. Cartography: Thematic Map Design , 1990 .
[30] Charles U. Martel,et al. On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.
[31] G. Steiner. Finding the largest suborder of fixed width , 1992 .
[32] Leonidas J. Guibas,et al. Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..
[33] John Hershberger,et al. Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.
[34] Javier Cc Ordova. A Heuristic Algorithm for the Rectilinear Steiner Arborescence Problem , 1994 .
[35] David Eppstein,et al. Arboricity and Bipartite Subgraph Listing Algorithms , 1994, Inf. Process. Lett..
[36] Majid Sarrafzadeh,et al. Sliceable Floorplanning by Graph Dualization , 1995, SIAM J. Discret. Math..
[37] Herbert Edelsbrunner,et al. A combinatorial approach to cartograms , 1995, SCG '95.
[38] Stéphane Dauzère-Pérès,et al. Minimizing late jobs in the general one machine scheduling problem , 1995 .
[39] Henk J. Scholten,et al. An Introduction to Geographical Information Systems , 1995 .
[40] Tamara Munzner,et al. Visualizing the global topology of the MBone , 1996, Proceedings IEEE Symposium on Information Visualization '96.
[41] Kenneth C. Cox,et al. 3D geographic network displays , 1996, SGMD.
[42] James Gary Propp. Generating random elements of finite distributive lattices , 1997, Electron. J. Comb..
[43] Subhash Suri,et al. Label placement by maximum independent set in rectangles , 1998, CCCG.
[44] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[45] Chak-Kuen Wong,et al. The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon , 1997, IEEE Trans. Computers.
[46] Goos Kant,et al. Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..
[47] Donald H. House,et al. A Constraint-Based Approach to Constructing Continuous Cartograms , 1998 .
[48] Terry A. Slocum. Thematic Cartography and Visualization , 1998 .
[49] Franz Aurenhammer,et al. Generalized Self-Approaching Curves , 1998, ISAAC.
[50] M. V. Kreveld,et al. Topologically correct subdivision simplification using the bandwidth criterion , 1998 .
[51] Gabriele Neyer. Line Simplification with Restricted Orientations , 1999, WADS.
[52] Alexander Wolff,et al. Point labeling with sliding labels , 1999, Comput. Geom..
[53] Weiping Shi,et al. The rectilinear Steiner arborescence problem is NP-complete , 2000, SODA '00.
[54] Pankaj K. Agarwal,et al. Efficient Algorithms for Approximating Polygonal Chains , 2000, Discret. Comput. Geom..
[55] Bing Lu,et al. Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem , 2000, J. Comb. Optim..
[56] Colin Ware,et al. Information Visualization: Perception for Design , 2000 .
[57] Jarke J. van Wijk,et al. Squarified Treemaps , 2000, VisSym.
[58] A. L. de Groot,et al. Practical Automaton proofs in PVS , 2000 .
[59] Susmita Sur-Kolay,et al. Slicible rectangular graphs and their optimal floorplans , 2001, TODE.
[60] B J Linney,et al. What to do next? , 2001, BMJ : British Medical Journal.
[61] Joseph S. B. Mitchell,et al. Simplifying a polygonal subdivision while keeping it simple , 2001, SCG '01.
[62] Stephen G. Kobourov,et al. Computing homotopic shortest paths efficiently , 2002, Comput. Geom..
[63] Jack Snoeyink,et al. Testing Homotopy for Paths in the Plane , 2002, SCG '02.
[64] J. Propp. Lattice structure for orientations of graphs , 2002, math/0209005.
[65] Hans Jürgen Prömel,et al. The Steiner Tree Problem , 2002 .
[66] Sarnath Ramnath,et al. New approximations for the rectilinear Steiner arborescence problem [VLSI layout] , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[67] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[68] C. SIAMJ.,et al. REVISITING TUCKER ’ S ALGORITHM TO COLOR CIRCULAR ARC GRAPHS , 2003 .
[69] Eu-Jin Goh,et al. Searching on Encrypted Data , 2003 .
[70] Martin Bravenboer,et al. Exercises in Free Syntax. Syntax Definition, Parsing, and Assimilation of Language Conglomerates , 2003 .
[71] Sergei N. Bespamyatnikh. Computing homotopic shortest paths in the plane , 2003, SODA '03.
[72] Philippe Baptiste,et al. A branch and bound to minimize the number of late jobs on a single machine with release time constraints , 2003, Eur. J. Oper. Res..
[73] Seok-Hee Hong,et al. The Metro Map Layout Problem , 2004, InVis.au.
[74] Stefan Felsner,et al. Lattice Structures from Planar Graphs , 2004, Electron. J. Comb..
[75] Daniel A. Keim,et al. CartoDraw: a fast algorithm for generating contiguous cartograms , 2004, IEEE Transactions on Visualization and Computer Graphics.
[76] Alexander Wolff,et al. Boundary labeling: Models and efficient algorithms for rectangular maps , 2004, Comput. Geom..
[77] Daniel A. Keim,et al. RecMap: Rectangular Map Approximations , 2004, IEEE Symposium on Information Visualization.
[78] Alexander Wolff,et al. Algorithms for the placement of diagrams on maps , 2004, GIS '04.
[79] Bettina Speckmann,et al. On rectangular cartograms , 2004, Comput. Geom..
[80] Therese C. Biedl,et al. Complexity of Octagonal and Rectangular Cartograms , 2005, CCCG.
[81] Joseph S. B. Mitchell,et al. L1 shortest paths among polygonal obstacles in the plane , 1992, Algorithmica.
[82] Éva Tardos,et al. Algorithm design , 2005 .
[83] Thomas Bäck,et al. Mixed-integer evolution strategies for parameter optimization and their applications to medical image analysis , 2005 .
[84] James H. Anderson,et al. Tardiness bounds under global EDF scheduling on a multiprocessor , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).
[85] Magiel Bruntink,et al. Renovation of idiomatic crosscutting concerns in embedded systems , 2005 .
[86] Mark de Berg,et al. Schematization of networks , 2005, Comput. Geom..
[87] P. Hanrahan,et al. Flow map layout , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..
[88] Éric Fusy,et al. Transversal Structures on Triangulations, with Application to Straight-Line Drawing , 2005, GD.
[89] Frank K. Hwang,et al. The rectilinear steiner arborescence problem , 2005, Algorithmica.
[90] AJ Arjan Mooij,et al. Constructive formal methods and protocol standardization , 2006 .
[91] Bettina Speckmann,et al. Area-preserving approximations of polygonal paths , 2006, J. Discrete Algorithms.
[92] Cjf Cas Cremers. Scyther : semantics and verification of security protocols , 2006 .
[93] Stephen G. Kobourov,et al. Drawing with Fat Edges , 2006, Int. J. Found. Comput. Sci..
[94] Martijn Warnier,et al. Language based security for Java and JML , 2006 .
[95] Ricardo Corin,et al. Analysis Models for Security Protocols , 2006 .
[96] Bettina Speckmann,et al. Optimal BSPs and rectilinear cartograms , 2006, GIS '06.
[97] Tomas Krilavicius,et al. Hybrid Techniques for Hybrid Systems , 2006 .
[98] Eelco Dolstra,et al. The purely functional software deployment model , 2006 .
[99] G Giovanni Russello,et al. Separation and adaptation of concerns in a shared data space , 2006 .
[100] Bahareh Badban,et al. Verification Techniques for Extensions of Equality Logic , 2006 .
[101] B. Gebremichael-Tesfagiorgis,et al. Expressivity of Timed Automata Models , 2006 .
[102] B. Slack,et al. The Geography of Transport Systems , 2006 .
[103] Ling Cheung,et al. Reconciling nondeterministic and probabilistic choices , 2006 .
[104] Sanjoy K. Baruah,et al. The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors , 2006, Real-Time Systems.
[105] Joseph S. B. Mitchell,et al. Turn-Constrained Route Planning for Avoiding Hazardous Weather , 2006 .
[106] Bettina Speckmann,et al. A Linear Programming Approach to Rectangular Cartograms , 2006 .
[107] Peter Verbaan,et al. The Computational Complexity of Evolving Systems , 2006 .
[108] C.-B. Breunesse. On JML: topics in tool-assisted verification of Java programs , 2006 .
[109] Danny Holten,et al. Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.
[110] Joachim Gudmundsson,et al. Path Simplification for Metro Map Layout , 2006, Graph Drawing.
[111] Iris Loeb. Natural Deduction, Sharing By Presentation , 2007 .
[112] Joseph S. B. Mitchell,et al. Thick non-crossing paths and minimum-cost flows in polygonal domains , 2007, SCG '07.
[113] Dimitrios M. Thilikos,et al. Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..
[114] Arjen van Weelden,et al. Putting Types To Good Use , 2007 .
[115] Dmitri Jarnikov,et al. QoS framework for video streaming in home networks , 2007 .
[116] Alexander Wolff,et al. Drawing Subway Maps: A Survey , 2007, Informatik - Forschung und Entwicklung.
[117] R. Boumen,et al. Integration and test plans for complex manufacturing systems , 2007 .
[118] Laura Brandán Briones,et al. Theories for Model-based Testing: Real-time and Coverage , 2007 .
[119] Marcus Brazil,et al. Network optimization for the design of underground mines , 2007, Networks.
[120] Cfj Christian Lange,et al. Assessing and improving the quality of modeling : a series of empirical studies about the UML , 2007 .
[121] T. D. Vu,et al. Semantics and applications of process and program algebra , 2007 .
[122] Rephael Wenger,et al. Constructing pairwise disjoint paths with few links , 2007, TALG.
[123] Bastiaan Stephan Graaf,et al. Model-Driven Evolution of Software Architectures , 2007, 11th European Conference on Software Maintenance and Reengineering (CSMR'07).
[124] Krishna M. Kavi,et al. A non-preemptive scheduling algorithm for soft real-time systems , 2007, Comput. Electr. Eng..
[125] Mohammad Ali Abam. New data structures and algorithms for mobile data , 2007 .
[126] Alexander Wolff,et al. Optimizing active ranges for consistent dynamic map labeling , 2008, SCG '08.
[127] Wolter Pieters,et al. La volonté machinale: understanding the electronic voting controversy , 2008 .
[128] E Elena Mumford,et al. Drawing graphs for cartographic applications , 2008 .
[129] de Ism Ivo Jong. Integration and test strategies for complex manufacturing machines , 2008 .
[130] Aad Mathssen,et al. Logical Calculi for Reasoning with Binding , 2008 .
[131] Alexander Wolff,et al. Trimming of Graphs, with Application to Point Labeling , 2008, Theory of Computing Systems.
[132] Ncwm Niels Braspenning. Model-based integration and testing of high-tech multi-disciplinary systems , 2008 .
[133] Jason Dykes,et al. Spatially Ordered Treemaps , 2008, IEEE Transactions on Visualization and Computer Graphics.
[134] Hong Zhou,et al. Geometry-Based Edge Clustering for Graph Visualization , 2008, IEEE Transactions on Visualization and Computer Graphics.
[135] Ivan S. Zapreev. Model checking Markov chains : techniques and tools , 2008 .
[136] Marius Adrian Marin,et al. An Integrated System to Manage Crosscutting Concerns in Source Code , 2008 .
[137] M. Torabi Dashti,et al. Keeping Fairness Alive : Design and formal verification of optimistic fair exchange protocols , 2008 .
[138] Scw Bas Ploeger,et al. Improved verification methods for concurrent systems , 2009 .
[139] Hasan Sözer,et al. Architecting Fault-Tolerant Software Systems , 2009 .
[140] Hugo Jonker,et al. Security matters : privacy in voting and fairness in digital exchange , 2009 .
[141] M. J. de Mol,et al. Reasoning about functional programs : Sparkle, a proof assistant for Clean , 2009 .
[142] Éric Fusy,et al. Transversal structures on triangulations: A combinatorial study and straight-line drawings , 2006, Discret. Math..
[143] van Mpwj Michiel Osch. Automated model-based testing of hybrid systems , 2009 .
[144] Mari Antonius Cornelis Dekker,et al. Flexible Access Control for Dynamic Collaborative Environments , 2009 .
[145] A. Rodriguez Yakushev,et al. Towards Getting Generic Programming Ready for Prime Time , 2009 .
[146] Tingting Han,et al. Diagnosis, Synthesis and Analysis of Probabilistic Models , 2009, Ausgezeichnete Informatikdissertationen.
[147] Ali Mesbah,et al. Analysis and Testing of Ajax-based Single-page Web Applications , 2009 .
[148] J. Kwisthout,et al. The Computational Complexity of Probabilistic Networks , 2009 .
[149] Sebastiaan Gijsbert Marinus Cornelissen,et al. Evaluating Dynamic Analysis Techniques for Program Comprehension , 2009 .
[150] Ryo Inoue. NEW SOLUTION FOR CONSTRUCTION OF RECTILINEAR AREA CARTOGRAM , 2009 .
[151] Karina R. Olmos Joffré. Strategies for Context Sensitive Program Transformation , 2009 .
[152] Bettina Speckmann,et al. Algorithmic Aspects of Proportional Symbol Maps , 2009, Algorithmica.
[153] Diansheng Guo,et al. Flow Mapping and Multivariate Visualization of Large Spatial Interaction Data , 2009, IEEE Transactions on Visualization and Computer Graphics.
[154] H. Hansen. Coalgebraic Modelling : Applications in Automata theory and Modal logic , 2009 .
[155] Jarke J. van Wijk,et al. Force‐Directed Edge Bundling for Graph Visualization , 2009, Comput. Graph. Forum.
[156] Marcel Verhoef,et al. Modeling and validating distributed embedded real-time control systems , 2009 .
[157] Doantam Phan,et al. Trading spaces: Calculating embodied Ecological Footprints in international trade using a Product Land Use Matrix (PLUM) , 2009 .
[158] Bettina Speckmann,et al. Area-universal rectangular layouts , 2009, SCG '09.
[159] Tim K. Cocx,et al. Algorithmic tools for data-oriented law enforcement , 2009 .
[160] Martin Nöllenburg,et al. Path Schematization for Route Sketches , 2010, SWAT.
[161] J. Dykes,et al. Visualisation of Origins, Destinations and Flows with OD Maps , 2010 .
[162] David Eppstein,et al. Steinitz theorems for orthogonal polyhedra , 2009, J. Comput. Geom..
[163] E. Bertini,et al. Using Flow Maps to Explore Migrations Over Time , 2010 .
[164] David Eppstein,et al. Regular labelings and geometric structures , 2010, CCCG.
[165] Bettina Speckmann,et al. Homotopic Rectilinear Routing with Few Links and Thick Edges , 2010, LATIN.
[166] Tom Staijen,et al. Graph-based Specification and Verification for Aspect-Oriented Languages , 2010 .
[167] Martin R. Neuhäußer,et al. Model checking nondeterministic and randomly timed systems , 2010 .
[168] de A. Bruin,et al. Service-oriented discovery of knowledge : foundations, implementations and applications , 2010 .
[169] Bettina Speckmann,et al. Necklace Maps , 2010, IEEE Transactions on Visualization and Computer Graphics.
[170] C. J. Boogerd,et al. Focusing Automatic Code Inspections , 2010 .
[171] Jean-Daniel Fekete,et al. An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs , 2011, 2011 IEEE Pacific Visualization Symposium.
[172] B. J. Arnoldus,et al. An illumination of the template enigma : software code generation with templates , 2011 .
[173] A. Morali,et al. IT architecture-based confidentiality risk assessment in networks of organizations , 2011 .
[174] Z Zvezdan Protic,et al. Configuration management for models : generic methods for model comparison and model co-evolution , 2011 .
[175] Hendrik Michaël van der Bijl,et al. On changing models in model-based testing , 2011 .
[176] Miguel E. Andrés,et al. Quantitative Analysis of Information Leakage in Probabilistic and Nondeterministic Systems , 2011, ArXiv.
[177] Somayeh Malakuti Khah Olun Abadi. Event composition model: achieving naturalness in runtime enforcement , 2011 .
[178] José Proença,et al. Synchronous Coordination of Distributed Components , 2011 .
[179] van Pja Paul Tilburg. From computability to executability : a process-theoretic view on automata theory , 2011 .
[180] Alexander Wolff,et al. Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming , 2011, IEEE Transactions on Visualization and Computer Graphics.
[181] Lacramioara Astefanoaei,et al. An executable theory of multi-agent systems refinement , 2011 .
[182] Stephanie Kemper,et al. Modelling and analysis of real-time coordination patterns , 2011 .
[183] Martin Nöllenburg,et al. Consistent labeling of rotating maps , 2011, J. Comput. Geom..
[184] D. Dorling. Area Cartograms: Their Use and Creation , 2011 .
[185] Bettina Speckmann,et al. A new method for subdivision simplification with applications to urban-area generalization , 2011, GIS.
[186] M Muhammad Atif,et al. Formal modeling and verification of distributed failure detectors , 2011 .
[187] Ronald Middelkoop,et al. Capturing and exploiting abstract views of states in OO verification , 2011 .
[188] Bettina Speckmann,et al. Flow Map Layout via Spiral Trees , 2011, IEEE Transactions on Visualization and Computer Graphics.
[189] R. Bakhshi. Gossiping Models : Formal Analysis of Epidemic Protocols , 2011 .
[190] Lennart C. L. Kats,et al. Building Blocks for Language Workbenches , 2011 .
[191] Young-Joo Moon,et al. Stochastic models for quality of service of component connectors , 2011 .
[192] Sonja Georgievska,et al. Probability and hiding in concurrent processes , 2011 .
[193] Bas Basten,et al. Ambiguity Detection for Programming Language Grammars , 2011 .
[194] Bettina Speckmann,et al. Area-Universal and Constrained Rectangular Layouts , 2012, SIAM J. Comput..
[195] Stefan Felsner,et al. Computing cartograms with optimal complexity , 2012, SoCG '12.
[196] van Mf Marcel Amstel,et al. Assessing and improving the quality of model transformations , 2012 .
[197] Bettina Speckmann,et al. Evolution Strategies for Optimizing Rectangular Cartograms , 2012, GIScience.
[198] Kevin Verbeek. Homotopic C-oriented routing , 2013 .
[199] Bettina Speckmann,et al. Angle-Restricted Steiner Arborescences for Flow Map Layout , 2011, Algorithmica.
[200] Martin Nöllenburg,et al. On d-regular schematization of embedded paths , 2011, Comput. Geom..