------------------------------------------------------------------------
The above article is cited in the following articles:
Chen C Y and Wu K P, Disproving a conjecture on planar visibility graphs, THEOR COMPUT SCI 255 (1-2): 659-665 MAR 28 2001
Bhattacharya B K and Ghosh S K, Characterizing LR-visibility polygons and related problems, COMP GEOM-THEOR APPL 18 (1): 19-36 FEB 2001
Biswas S, Prasad D C and Pal S P, Recognizing weakly convex visible polygons, COMP GEOM-THEOR APPL 10 (3): 171-186 JUN 1998
Chen D Z, Determining weak visibility of a polygon from an edge in parallel, INT J COMPUT GEOM AP 8 (3): 277-304 JUN 1998
Ghosh S K, On recognizing and characterizing visibility graphs of simple polygons, DISCRETE COMPUT GEOM 17 (2): 143-162 MAR 1997
Biswas S, Prasad D C and Pal S P, Algorithms for convex visibility problems LECT NOTES COMPUT SC 880: 181-192 1994
Bhadury J and Chandrasekaran R, Stock cutting of complicated designs by computing minimal nested polygons, ENG OPTIMIZ 25 (3): 165-178 1995
-------------------------------------------------------------------
---------------------------------------------------------------------------------------
The above article is cited in the following article.
Bhattacharya B K and Ghosh S K, Characterizing LR-visibility polygons and related problems, COMP GEOM-THEOR APPL 18 (1): 19-36 FEB 2001
------------------------------------------------------------------------------------------
-----------------------------------------------------
The above article is cited in the following articles:
Recent Results in Art Galleries by Thomas C. Shermer, Proceedings of the IEEE, Vol. 80, No. 9, September 1992, pp. 1384-1399.
Three-dimensional weak visibility: Complexity and applications, Cao An Wang and Binhai Zhu, Theoretical Computer Science 234 (2000), pp. 219-232.
---------------------------------------------------------
Abstract
Channel routing is a key problem in the physical design of VLSI chips. It is known that max(dmax, vmax) is a lower bound on the number of tracks required in the reserved two-layer Manhattan routing model, where dmax is the channel density and vmax is the length of the longest path in the vertical constraint graph. In this paper we propose a deterministic polynomial time algorithm that computes a better and non-trivial lower bound on the number of tracks required for routing a channel without doglegging. This algorithm is also applicable for computing a lower bound on the number of tracks in the three-layer no-dogleg HVH routing as well as two- and three-layer restricted dogleg routing models.
Keywords: Channel routing problem; Channel constraint graphs; Reserved layer Manhattan routing model; Doglegging; Lower bound.
-----------------------------------------------------------------------------------
ABSTRACT: We propose a Monte Carlo scheme (GRAPES) for generating synthetic web request streams. These request streams obey the Zipf page popularity distribution and temporal locality in the form of log-normal stack-distance distribution. Our algorithm avoids the use of an explicit stack; it uses a precomputed set of coefficients representing stack-distance distribution to generate web page requests. Using these coefficients our the algorithm runs in time proportional to the number of generated requests in contrast to other request stream generators that run in time proportional to the product of the stack size and the number of generated requests. The performance plots suggest a speedup of an order of magnitude for large inputs. We use an intricate randomization strategy to produce a uniform and random request stream. Our scheme is amenable to an efficient parallel implementation.
-------------------------------------------------------------------------------
Smruti Sarangi (B. Tech. 1998-2002),
P. N. Sireesh (B. Tech. 1998-2002)
and S. P. Pal,
Generating synthetic web request
streams,
Technical Report, TR/IIT/CSE/SPP3,
Nov 2001, Department of Computer Science and Engineering, IIT Kharagpur,
721302, India,