1887

n South African Computer Journal - A greedy heuristic for Axial Line Placement in collections of convex polygons : reviewed article

USD

 

Abstract

The Axial Line Placement problem has been shown to be NP-complete. This means that work into finding approximate solutions to the general problem is warranted. The majority of the research conducted so far has concentrated on the restricted case of axial line placement in collections of orthogonal rectangles. The only work done with convex polygons has been in the restricted case of deformed urban grids. This article presents the first heuristic for placing axial lines in collections of adjacent non-overlapping convex polygons.

Loading

Article metrics loading...

/content/comp/2006/37/EJC28021
2006-12-01
2016-12-08
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error