
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ramakrishna Thurimella, Mario Alberto Lopez, "On Computing Connected Components of Line Segments," IEEE Transactions on Computers, vol. 44, no. 4, pp. 597601, April, 1995.  
BibTex  x  
@article{ 10.1109/12.376174, author = {Ramakrishna Thurimella and Mario Alberto Lopez}, title = {On Computing Connected Components of Line Segments}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {4}, issn = {00189340}, year = {1995}, pages = {597601}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.376174}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Computing Connected Components of Line Segments IS  4 SN  00189340 SP597 EP601 EPD  597601 A1  Ramakrishna Thurimella, A1  Mario Alberto Lopez, PY  1995 KW  Connected components KW  line segments KW  nets KW  Hopcroft’s problem. VL  44 JA  IEEE Transactions on Computers ER   
[1] P.K. Agarwal,“Partitioning arrangements of lines I: An efficient deterministic algorithm,” Discrete Comput. Geom., vol. 5, pp. 449483, 1990.
[2] P.K. Agarwal,“Partitioning arrangements of lines II: Applications,” Discrete Comput. Geom., vol. 5, pp. 533573, 1990.
[3] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[4] H. Edelsbrunner,L.J. Guibas,, and J. Stolfi,“Optimal point location in a monotone subdivision,” SIAM J. Comput., vol. 15, no. 2, pp. 317340, 1986.
[5] H. Edelsbrunner,L.J. Guibas,, and M. Sharir,“The complexity and construction of many faces in an arrangement of lines and of segments,” Discrete Comput. Geom., vol. 5, pp. 161196, 1990.
[6] H. Edelsbrunner,J. O’Rourke,, and R. Seidel,“Constructing arrangements of lines and hyperplanes with applications,” SIAM J. Comput., vol. 15, no. 2, pp. 341363, 1986.
[7] H. Edelsbrunner,J. van Leeuwen,T. Ottmann,, and D. Wood,“Computing connected components of simple rectilinear geometrical objects indspace,” RAIRO Theoretical Informatics, vol. 18, no. 2, pp. 171183, 1984.
[8] L.J. Guibas and J. Saxe,“Problem 8015,” J. Algorithms, vol. 4, pp. 176181, 1983.
[9] L.J. Guibas and M. Sharir,Computing the Unbounded Component of an Arrangement of Line Segments, manuscript, (1987).
[10] M. Lopez,R. Janardan,, and S. Sahni,“A fast algorithm for VLSI net extraction,” Proc. IEEE/ACM Int’l Conf. CAD, pp. 770774, 1993.
[11] J.S.B. Mitchell,On Computing a Single Face in an Arrangement of Line Segments, manuscript, (1990).
[12] H.G. Mairson and J. Stolfi,“Reporting and counting intersections between two sets of line segments,” NATO ASI series, Theoretical Foundations of Computer Graphics and CAD, SpringerVerlag, pp. 307325, 1988.
[13] ${\rm J.\ Matou\!\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}} \over s} ek}$,“Cutting hyperplane arrangements,” Discrete Comput. Geom., vol. 6, pp. 385406, 1991.
[14] ${\rm J.\ Matou\!\mathord{\buildrel{\lower3pt\hbox{$\scriptscriptstyle\smile$}} \over s} ek}$,“Range searching with efficient hierarchical cuttings,” Proc. 8th Ann. ACM Symp. Comput. Geom., pp. 276285, 1992.
[15] S. Nahar and S. Sahni,“Time and space efficient net extractor,” Computer Aided Design, vol. 20, no. 1, pp. 1726, 1988.
[16] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.