Filters








14 Hits in 4.1 sec

Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design [chapter]

Subhas C Nandy, Bhargab B Bhattacharya, Sibabrata Ray
1990 Lecture Notes in Computer Science  
the area have studied MERs for different applications like VLSI layout.  ...  In their non-overlapping rectangles representation, the free space can be Overlapping Maximal Empty Rectangles Another type of empty rectangle is the Maximal Empty Rectangle (MER).  ...  The main goal of this chapter is to examine whether the ideas behind schedulers designed for homogeneous devices will work for heterogeneous devices.  ... 
doi:10.1007/3-540-53487-3_50 fatcat:twijq2vqqrfl5kh44jq6blmfx4

Page 5125 of Mathematical Reviews Vol. , Issue 911 [page]

1991 Mathematical Reviews  
algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design.  ...  all maximal empty rectangles (MERs).  ... 

On finding an empty staircase polygon of largest area (width) in a planar point-set

Subhas C. Nandy, Bhargab B. Bhattacharya
2003 Computational geometry  
This paper presents an algorithm for identifying a maximal empty-staircase-polygon (MESP) of largest area, among a set of n points on a rectangular floor.  ...  The algorithm can be easily tailored for identifying the widest MESP in a similar environment.  ...  In VLSI layout design, isothetic polygons play a major role; the sides of these polygons are parallel to the coordinate axes [3] .  ... 
doi:10.1016/s0925-7721(03)00015-4 fatcat:u6xnkzrs7zcxrlbvyh7vo7bwnq

Applications of a numbering scheme for polygonal obstacles in the plane [chapter]

Mikhail J. Atallah, Danny Z. Chen
1996 Lecture Notes in Computer Science  
We present efficient algorithms for the problems of matching red and blue disjoint geometric obstacles in the plane and connecting the matched obstacle pairs with mutually noninlersecl.ing paths that have  ...  Based on a numbering scheme for certain geometric objects and on several useful geometric observations, we develop an O(n log n) time, O(n) space algorithm that produces a desired matching for isothetic  ...  relevance to VLSI layout applications (16, 26, 35] (e.g., VLSI single-layer routing).  ... 
doi:10.1007/bfb0009476 fatcat:cfju642z25gwve6pkvs3zo2h54

A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids

S.C. Nandy, B.B. Bhattacharya
1995 Computers and Mathematics with Applications  
Finally, the algorithm is extended for identifying a cuboid, i.e., a rectangular parallelepiped that encloses maximum number of polyhedral objects in R 3.  ...  For both of these problems, a new algorithm based on interval tree data structure is presented, which runs in O(n log n) time and consumes O(n) space.  ...  INTRODUCTION Range searching problems of computational geometry have manifold applications to operations research, database management, pattern recognition, robotics, VLSI layout design, to name a few.  ... 
doi:10.1016/0898-1221(95)00029-x fatcat:b2adpeh4dzggtp654zqnwdyhsa

Page 4526 of Mathematical Reviews Vol. , Issue 91H [page]

1991 Mathematical Reviews  
Bhattacharya and Sibabrata Ray, Efficient algorithms for identify- ing all maximal isothetic empty rectangles in VLSI layout design (pp. 255-269); Amitava Datta and G. D. S.  ...  Sivakumar and Han- tao Zhang, A new method for proving termination of AC-rewrite systems (pp. 133-148); John Reif and Akhilesh Tyagi, Efficient parallel algorithms for optical computing with the DFT primitive  ... 

Moment-preserving sharpening—A new approach to digital picture deblurring

Ling-Hwei Chen, Wen-Hsiang Tsai
1988 Computer Vision Graphics and Image Processing  
Experimental results show that the approach is indeed effective for picture deblurring. Boolean combinations of VLSI masks are important in VLSI design.  ...  We describe an optimal algorithm for two layers and rectangles having the same orientation in the plane.  ...  Beck for typesetting this paper.  ... 
doi:10.1016/0734-189x(88)90114-4 fatcat:4jukmqn3wfdq3i7qthwne2bose

Hierarchically specified unit disk graphs

Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt, S.S. Ravi
1997 Theoretical Computer Science  
The approximation algorithms presented here along with our results in [24, 25] are among the first polynomial time approximation algorithms for natural PSPACE-hard functions.  ...  We characterize the complexity of a number of basic optimization problems for unit disk graphs specified hierarchically as in [2, 17, 19, 201.  ...  Rosenkrantz for many helpful comments. Madhav Marathe also thanks Egon Wanke for an interesting conversation on succinct specifications.  ... 
doi:10.1016/s0304-3975(96)00008-4 fatcat:ylad3vlzkbbq5aiiwwl5c7jiie

Hierarchically specified unit disk graphs [chapter]

M. V. Marathe, V. Radhakrishnan, H. B. Hunt, S. S. Ravi
1994 Lecture Notes in Computer Science  
The approximation algorithms presented here along with our results in [24, 25] are among the first polynomial time approximation algorithms for natural PSPACE-hard functions.  ...  We characterize the complexity of a number of basic optimization problems for unit disk graphs specified hierarchically as in [2, 17, 19, 201.  ...  Rosenkrantz for many helpful comments. Madhav Marathe also thanks Egon Wanke for an interesting conversation on succinct specifications.  ... 
doi:10.1007/3-540-57899-4_38 fatcat:2g4guthovzejtlyh57exl573vu

Unsolved Problems in Visibility Graphs of Points, Segments and Polygons [article]

Subir Kumar Ghosh, Partha Pratim Goswami
2012 arXiv   pre-print
In this survey paper, we present open problems and conjectures on visibility graphs of points, segments and polygons along with necessary backgrounds for understanding them.  ...  Open Problem 31 Design an algorithm for testing Necessary Condition 4 in polynomial time.  ...  Bar Visibility Graphs The idea of representing a graph using a visibility relation was introduced in the 1980s as a model tool for VLSI layout problems [31, 100] .  ... 
arXiv:1012.5187v4 fatcat:bt6jihgqwrblnavyaoeju2udtu

Page 1276 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(with Bhattacharya, Bhargab B.; Ray, Sibabrata) Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design. 911:68153 Nef, Walter (with Schmidt, Peter-Michael) Computing  ...  ., 911:68205 Olariu, Stephan A simple linear-time algorithm for computing the RNG and MST of unimodal polygons. 91b:68116 Orlowski, Marian A new algorithm for the largest empty rectangle problem. 91a:68271  ... 

Page 871 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
(with Bhattacharya, Bhargab B.; Ray, Sibabrata) Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design.  ...  An efficient reconstruction of a graph from its line graph in parallel. J. Algorithms 11 (1990), no. 1, 132-143.  ... 

Page 110 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
.; Ray, Sibabrata) Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design.  ...  Tharthare) 91a:62197 62K10 — Optimal incomplete block designs for comparing treatments with a control under the nearest neighbor correlation model. Utilitas Math. 38 (1990), 15-25.  ... 

UC San Diego UC San Diego Electronic Theses and Dissertations Title Interconnect Synthesis Permalink https://escholarship.org/uc/item/56w2h8w8 Publication Date

Author Venkatesh, Sriram
2018 unpublished
Illustration of largest empty (isothetic, i.e., with axis-parallel edges) rectangle.  ...  As noted above, the bounding box of pointset P is the minimal isothetic (axis-parallel) rectangle that contains all points of P.  ... 
fatcat:d3scpgv7rbalplg3wxkvjyhqti