Generalizing Geometric Graphs

DOI10.1007/978-3-642-25878-7_18zbMath1311.68107OpenAlexW1417993129MaRDI QIDQ5895515

Dorothea Wagner, Edith Brunel, Marcus Krug, Andreas Gemsa, Ignaz Rutter

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_18

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Uses Software

• LunarVis
• SparseMatrix
• OpenStreetMap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Delaunay graphs are almost as good as complete graphs
• Greed is good: Approximating independent sets in sparse and bounded-degree graphs
• The upper envelope of piecewise linear functions: Algorithms and applications
• Unit disk graphs
• The university of Florida sparse matrix collection
• Optimal Binary Space Partitions in the Plane
• New upper bounds for neighbor searching
• Decomposable searching problems I. Static-to-dynamic transformation
• Drawing Huge Graphs by Algebraic Multigrid Optimization
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• LunarVis – Analytic Visualizations of Large Graphs
• Graph Drawing
• Generalizing Geometric Graphs

This page was built for publication: Generalizing Geometric Graphs