Abstract
We consider two optimization problems with geometric structures. The first one concerns the foUowing minimization problem, termed as the rectilinear polygon cover problem: “Cover certain features of a given rectilinear polygon (possibly with rectilinear holes) with the minimum number of rectangles included in the polygon.” Depending upon whether one wants to cover the interior, boundary or corners of the polygon, the problem is termed as the interior, boundary or corner cover problem, respectively. Most of these problems are known to be NP-complete. In this chapter we survey some of the important previous results for these problems find provide a proof of impossibility of a polynomial-time approximation scheme for the interior and boundary cover problems. The second problem concerns routing in a segmented routing channel. The related problems are fundamental to routing and design automation for Field Programmable Gate Arrays (FPGAs), a new type of electrically programmable VLSI. In this chapter we survey the theoretical results on the combinatorial complexity and algorithm design for segmented channel routing. It is known that the segmented channel routing problem is in general NP-Complete. Efficient polynomial time algorithms for a number of important special cases are presented.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Hardness of Approximation Problems. Proc. 33rd IEEE Symp. Found, of Comp. Sc.(FOCS) (1992), pp. 14–23.
P. Berman and B. DasGupta, Results on Approximation of the Rectilinear Polygon Cover Problems, Tech Rep. # CS-92-07, Department of Computer Science, Penn State, 1992.
P. Berman and G. Schnitger. On the Complexity of Approximating the Independent Set Problem. Symp. on Theo. Aspects of Computing(STACS) (1989), pp. 256–268.
S. Chaiken, D. J. Kleitman, M. Saks and J. Shearer. Covering Regions by Rectangles. SIAM J. Algebraic Discrete methods, 2 (1981), pp. 394–410.
H. E. Conn, and J. O’Rourke. Some restricted rectangle covering problems. Tech Rep. JHU-87/13, The Johns Hopkins University, Baltimore, MD, 1987, also appeared in Proc. of the 1987 Allerton Conference (1987), pp. 898–907.
T. H. Corman, C. E. Leiserson and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts, 1990.
J. Culberson and R. A. Reckhow. Covering Polygon is Hard. Proc. 29th IEEE Symp. Found, of Comp. Sc.(FOCS) (1988), pp. 601–611.
D. S. Franzblau. Performance Guarantees on a Sweep-line Heuristic for Covering Rectilinear Polygons with Rectangles. SIAM J. Disc. Math., 2 (1989), pp. 307–321.
D. S. Franzblau and D. J. Kleitman. An Algorithm for Constructing Regions with Rectangles. Proc. 16th ACM, Symp. Theory of Comput.(STOC), 1984, pp. 167–174.
A. El Gamal. Two Dimensional Stochastic Model for Interconnections in Master Slice Integrated Circuits. IEEE Trans, on Circuits and Systems, CAS-28, 127–138, February, 1981.
A. El Gamal, J. Greene and V. P. Roychowdhury. Segmented Channel Routing is as Efficient as Conventional Routing (and Just as Hard). Proc. 13th Conference on Advanced Research in VLSI, UC Santa Cruz, pp. 192–211, March 1991.
A. El Gamal, J. Greene, J. Reyneri, E. Rogoyski, K. El-Ayat, and A. Mohsen. An Architecture for Electrically Configurable Gate Arrays. IEEE J. Solid-State Circuits, Vol. 24, No. 2, April, 1989, pp. 394–398.
M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.
A. Hashimoto and J. Stevens. Wire Routing by Optimizing Channel Assignment Within Large Apertures. Proc. 8th IEEE Design Automation Workshop, 1971.
H. Hsieh, et al. A Second Generation User Programmable Gate Array. Proc. Custom Integrated Circuits Conf., May 1987, pp. 515–521.
M. Lorenzetti and D. S. Baeder. Routing. Chapter 5 in Physical Design Automation of VLSI Systems, B. Preas and M. Lorenzetti, eds. Benjamin/Cummings, 1988.
A. Lubiw. Ordering and some Combinatorial Optimization Problems with some Geometric Applications. Ph. D. Thesis, University of Waterloo, Ontario, Canada, 1985.
A. Lubiw. The Boolean Basis Problem and how to Cover Polygons by Rectangles. University of Waterloo, Ontario, Canada, Manuscript, 1988. Referenced in [8].
W. J. Masek. Some NP-complete Set Covering Problems. MIT, Cambridge, MA, unpublished manuscript. Referenced in [13].
C. Mead and L. Conway. Introduction to VLSI Systems. Addision-Wesley, Reading, MA., 1980, Chapters 2 and 4.
R. Motwani, A. Raghunathan and H. Saran. Perfect Graphs and Orthogonally Convex Covers. 4th SIAM Conf. on Discr. Math. (1988).
T. Ohtsuki. Minimum Dissection of Rectilinear Polygons. Proc. IEEE Symp. on Circuits and Systems (1982), pp. 1210–1213.
L. Pagli, E. Lodi, F. Lucçio, C. Mugnai and W. Mugnai. On Two Dimensional Data Organization 2. Fund. Inform 2 (1979), pp. 211–226.
C. H. Papadimitrou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Inc., New Jersey, 1982.
V. P. Roychowdhury, J. Greene and A. El Gamal. Segmented Channel Routing. IEEE Trans, on Computer-Aided Design of Integrated Circuits and Systems, vol. 12, No. 1, pp. 75–95, January 1993.
T. Szymanski. Dogleg Channel Routing is NP-Complete. IEEE Trans. CAD, CAD-4(1), pp. 31–41, Jan. 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Kluwer Academic Publishers
About this chapter
Cite this chapter
Dasgupta, B., Roychowdhury, V. (1994). Two Geometric Optimization Problems. In: Du, DZ., Sun, J. (eds) Advances in Optimization and Approximation. Nonconvex Optimization and Its Applications, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3629-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3629-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3631-0
Online ISBN: 978-1-4613-3629-7
eBook Packages: Springer Book Archive