A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
Proceedings of the nineteenth conference on Computational geometry - SCG '03
We study the problem of aligning horizontally, vertically, or diagonally, as many points as possible when each point is allowed to be placed anywhere in its own, given region. Different shapes of placement regions and different sets of alignment orientations are considered. More generally, we assume that a graph is given on the points, and only the alignments of points that are connected in the graph count. For the case of trees and planar graphs, we give approximation algorithms whosedoi:10.1145/777793.777796 fatcat:smivbzv5v5dzdeijsuvmyrfl2m