
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hossam ElGindy, Lachlan Wetherall, "A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 11331142, November, 1997.  
BibTex  x  
@article{ 10.1109/71.642948, author = {Hossam ElGindy and Lachlan Wetherall}, title = {A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {11}, issn = {10459219}, year = {1997}, pages = {11331142}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.642948}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh IS  11 SN  10459219 SP1133 EP1142 EPD  11331142 A1  Hossam ElGindy, A1  Lachlan Wetherall, PY  1997 KW  Parallel algorithms KW  reconfigurable mesh architectures KW  broadcasting buses KW  geometric algorithms KW  Voronoi diagram. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we introduce a simple and efficient algorithm for computing the Voronoi Diagram for
[1] A. Aggarwal, B. Chazelle, L. Guibas, C.Ó Dúnlaing, and C. Yap, "Parallel Computational Geometry," Proc. 26th IEEE Symp. Foundations of Computer Science, pp. 468477, 1985.
[2] A. Aggarwal, B. Chazelle, L. Guibas, C.Ó Dúnlaing, and C. Yap, "Parallel Computational Geometry," Algorithmica, vol. 3, no. 3, pp. 293327, 1988.
[3] H.M. Alnuweiri, M. Alimuddin, and H. Aljunaidi, "Switch Models and Reconfigurable Networks: Tutorial and Partial Survey," Proc. Workshop Reconfigurable Architectures, Eighth Int'l Parallel Processing Symp., Apr. 1994.
[4] N. Amato and F.P. Preparata, "The Parallel 3D Convex Hull Problem Revisited," Int'l J. Computational Geometry and Applications, vol. 2, no. 2, pp. 163174, 1992.
[5] N.M. Amato and F.P. Preparata, "An NC1Parallel 3D Convex Hull Algorithm," Proc. Ninth Ann. Symp. Computational Geometry, pp. 289297, May 1993.
[6] F. Aurenhammer, "Voronoi Diagrams: A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys, vol. 23, no. 3, 1991, pp. 345405.
[7] K.Q. Brown, "Voronoi Diagrams from Convex Hulls," Information Processing Letters, vol. 9, no. 5, pp. 223228, Dec. 1979.
[8] A.L. Chow, "Parallel Algorithms for Geometric Problems," PhD thesis, Dept. of Computer Science, Univ. of Illi nois, Urbana, 1980.
[9] R. Cole, M.T. Goodrich, and C.Ó Dúnlaing, "A Nearly Optimal Deterministic Parallel Voronoi Diagram Algorithm," Algorithmica, vol. 16, no. 6, pp. 569617, Dec. 1996.
[10] R. Cole, M.T. Goodrich, and C.Ó Dúnlaing, "Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction," Proc. 17th Int'l Colloquium Automata, Language, and Programming, M.S. Paterson, ed., pp. 432445, July 1990.
[11] N. Dadoun and D. Kirkpatrick, "Parallel Processing for Efficient Subdivision Search," Proc. Third Ann. Symp. Computational Geometry, pp. 205214, 1987.
[12] N. Dadoun and D. Kirkpatrick, "Parallel Construction of Subdivision Hierarchies," J. Computer and System Sciences, vol. 39, no. 2, pp. 153165, 1989.
[13] A.M. Day, "Parallel Implementation of 3D Convex Hull Algorithm," Computer Aided Design, vol. 23, no. 3, pp. 177187, Apr. 1991.
[14] F. Dehne, J.R. Sack, and I. Stojmenovic, "A Note on Determining the 3Dimensional Convex Hull of a Set of Points on a Mesh of Processors," Proc. First Scandinavian Workshop Algorithm Theory, Lectures Notes in Computer Science, vol. 318, pp. 154161. SpringerVerlag, 1988.
[15] H. Edelsbrunner, Algorithms in Combinatorical Geometry. EATCS Monographs in Computer Science, Berlin: Springer, 1987.
[16] H. ElGindy and L. Wetherall, "An L1 Voronoi Diagram Algorithm for a Reconfigurable Mesh," Proc. First Int'l Conf. Algorithms and Architectures for Parallel Processing, pp. 442449,Brisbane, Australia, Apr. 1995.
[17] D.J. Evans and I. Stojmenovic, "On Parallel Computation of Voronoi Diagrams," Parallel Computing, vol. 12, pp. 121125, 1989.
[18] J.W. Jang, H. Park, and V.K. Prasanna, "A Bit Model of Reconfigurable Mesh," Proc. Workshop Reconfigurable Architectures, Eighth Int'l Parallel Processing Symp., Apr. 1994.
[19] J. Jang and V.K. Prasanna,“An optimal sorting algorithm on reconfigurable mesh,” Proc. Int’l Parallel Processing Symp., pp. 130137, Mar. 1992.
[20] C.S. Jeong, "An Improved Parallel Algorithm for Constructing Voronoi Diagram on a Mesh Connected Computer," Parallel Computing, vol. 17, pp. 505514, 1991.
[21] C.S. Jeong, "Parallel Voronoi Diagram in L1 (L∞) Metric on a Mesh Connected Computer," Parallel Computing, vol. 17, pp. 241252, 1991.
[22] C.S. Jeong and D.T. Lee, "Parallel Geometric Algorithms on a MeshConnected Computer," Algorithmica, vol. 5, no. 2, pp. 155177, 1990.
[23] A. Kapoor, H. Schröder, and B. BeresfordSmith, "Constant Time Sorting on a Reconfigurable Mesh," Proc. 16th Australian Computer Science Conf., pp. 121132,Brisbane, Australia, Feb. 1993.
[24] F. Lee and S.Q. Zheng, "Constructing Voronoi Diagram of a Point Set on Mesh of Trees," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 136140, Aug. 1992.
[25] M. Lu, "Construction of the Voronoi Diagram on a MeshConnected Computer," Proc. Int'l Conf. Parallel Processing, pp. 806811, 1986.
[26] W. Mumbeck and W. Preilowski, "A New Nearly Optimal Parallel Algorithm for Computing Voronoi Diagrams," Technical Report 57, Fachbereich Mathematik/Informatik Universität Paderborn, Nov. 1988.
[27] K. Nakano, "Efficient Summing Algorithms for a Reconfigurable Mesh," Proc. Workshop Reconfigurable Architectures, Eighth Int'l Parallel Processing Symp., Apr. 1994.
[28] S. Olariu, J.L. Schwing, and J. Zhang, "Applications of Reconfigurable Meshes to Constant Time Calculations," Parallel Computing, vol. 19, no. 2, pp. 229237, Feb. 1993.
[29] W. Preilowski, E. Dahlhaus, and G. Wechsung, "New Parallel Algorithms for Convex Hull and Triangulation in 3Dimensional Space," Proc. MFCS, Lecture Notes in Computer Science, vol. 629, pp. 442450. SpringerVerlag, 1992.
[30] F.P. Preparata and S.J. Hong, "Convex Hulls of Finite Sets of Points in Two and Three Dimensions," Comm. ACM, vol. 20, no. 2, pp. 8793, Feb. 1977.
[31] J.H. Reif and S. Sen, "Polling: A New Randomized Sampling Technique for Computational Geometry," Proc. 21st ACM Symp. Theory of Computing, pp. 394404, May 1989.
[32] M.I. Shamos and D. Hoey, "Closest Point Problems," Proc. 16th IEEE Symp. Foundations of Computing, pp. 151162, 1975.
[33] I. Stojmenovic, "Parallel Computational Geometry," Technical Report CS87176, Washington State Univ., Nov. 1987.
[34] I. Stojmenovic, "Computational Geometry on a Hypercube," Proc. Int'l Conf. Parallel Processing, vol. 3, 1988.
[35] B.C. Vemuri, R. Varadarajan, and N. Maya, "An Efficient Expected Time Parallel Algorithm for Voronoi Construction," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 392401, 1992.