Placing Text Boxes on Graphs
From MaRDI portal
Recommendations
- A simple linear time algorithm for proper box rectangular drawings of plane graphs
- scientific article; zbMATH DE number 1830737
- On rectangle intersection and overlap graphs
- Box-rectangular drawings of planar graphs (extended abstract)
- A fast implementation for the 2D/3D box placement problem
- Enumerating bottom-left stable positions for rectangle placements with overlap
- Approximating the maximum overlap of polygons under translation
- Approximating the maximum overlap of polygons under translation
- An approximation algorithm for sequential rectangle placement
Cites work
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- Computational geometry. Algorithms and applications.
- Computing the maximum overlap of two convex polygons under translations
- Elastic labels around the perimeter of a map
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Finding the largest area axis-parallel rectangle in a polygon
- On fat partitioning, fat covering and the union size of polygons
- On the complexity of the union of fat convex objects in the plane
- Polygon containment under translation
- Sorting jordan sequences in linear time using level-linked search trees
- The complexity of the free space for motion planning amidst fat obstacles
This page was built for publication: Placing Text Boxes on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611861)