Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments

  • Leonidas Palios
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 824)


We consider the problem of finding the maximum number of nodes in a grid (from a given set of such nodes) that can be connected to the boundary of the grid by means of non-intersecting line segments parallel to the grid axes. The work is motivated from the VLSI/WSI array processor technology, and in particular, the single-track switch model for configurable array processors ([4]). The problem has been investigated by Bruck and Roychowdhury, who described an algorithm to find the maximum number of compatible connections of n given nodes in the grid in O(n3) time and O(n2) space ([2]). In this paper, we present methods that take advantage of the dependency of similar configurations and enable us to resolve the problem in O(n2log n) time and O(n2) space; instrumental in our algorithm is the use of a new type of priority search trees which is of interest in its own right.


Line Segment Array Processor Connection Pattern Grid Boundary Dummy Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Y. Birk and J.B. Lotspiech, “A Fast Algorithm for Connecting Grid Points to the Boundary with Nonintersecting Straight Lines,” Proc. 2nd Annual Symp. on Discrete Algorithms (1991), 465–474.Google Scholar
  2. 2.
    J. Bruck and V.P. Roychowdhury, “How to Play Bowling in Parallel on the Grid,” Journal of Algorithms12 (1991), 516–529.Google Scholar
  3. 3.
    K. Hwang and F.A. Briggs, “Computer Architecture and Parallel Processing,” McGraw Hill, New York, 1985.Google Scholar
  4. 4.
    S.Y. Kung, S.N. Jean, and C.W. Chang, “Fault-Tolerant Array Processors using Single-Track Switches,” IEEE Trans. on Computers38 (1989), 501–514.Google Scholar
  5. 5.
    E.M. McCreight, “Priority Search Trees,” SIAM Journal on Computing14 (1985), 257–276.MathSciNetGoogle Scholar
  6. 6.
    L. Palios, “Connecting Grid Points to the Boundary of the Grid by Means of Non-intersecting Line Segments,” Report GCG56, The Geometry Center, 1993.Google Scholar
  7. 7.
    R. Raghavan, J. Cohoon, and S. Sahni, “Manhattan and Rectilinear Wiring,” Tech. Report 81-5, Computer Science Dept., University of Minnesota, 1981.Google Scholar
  8. 8.
    V.P. Roychowdhury and J. Bruck, “On Finding Non-intersecting Paths in Grids and its Application in Reconfiguring VLSI/WSI Arrays,” Proc. 1st Annual Symp. on Discrete Algorithms (1990).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Leonidas Palios
    • 1
  1. 1.The Geometry CenterUniv. of MinnesotaUSA

Personalised recommendations