Placing Text Boxes on Graphs

DOI10.1007/978-3-642-00219-9_27zbMath1213.68475OpenAlexW1582706277MaRDI QIDQ3611861

Sjoerd van Hagen, Marc J. van Kreveld

Publication date: 3 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_27

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Finding the largest area axis-parallel rectangle in a polygon
• Computing the maximum overlap of two convex polygons under translations
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• On fat partitioning, fat covering and the union size of polygons
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• The complexity of the free space for motion planning amidst fat obstacles
• On the complexity of the union of fat convex objects in the plane
• Polygon containment under translation
• Elastic labels around the perimeter of a map
• Sorting jordan sequences in linear time using level-linked search trees
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT

This page was built for publication: Placing Text Boxes on Graphs