DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION

DOI10.1142/S021819590900299XzbMath1183.65019MaRDI QIDQ3401890

Marina L. Gavrilova

Publication date: 1 February 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmnumerical examplesgraphical examplesmap labelingsweep-line algorithmpolygons with holesU-shapegeographic information system (GIS) applicationsset of maximum inscribed rectangles

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Geodesy, mapping problems (86A30)

Cites Work

• Finding the largest area axis-parallel rectangle in a polygon
• A note on maximum independent sets in rectangle intersection graphs
• Optimal algorithm for a special point-labeling problem
• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• Label placement by maximum independent set in rectangles
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• Efficient algorithms for interval graphs and circular-arc graphs
• Algorithms for categorical equivalence
• Elastic labels around the perimeter of a map
• EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING

This page was built for publication: DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION