
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
VenkataVasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, "ConstantTime Algorithms for Constrained Triangulations on Reconfigurable Meshes," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 11, pp. 10571072, November, 1998.  
BibTex  x  
@article{ 10.1109/71.735954, author = {VenkataVasu Bokka and Himabindu Gurla and Stephan Olariu and James L. Schwing}, title = {ConstantTime Algorithms for Constrained Triangulations on Reconfigurable Meshes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {11}, issn = {10459219}, year = {1998}, pages = {10571072}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.735954}, 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  ConstantTime Algorithms for Constrained Triangulations on Reconfigurable Meshes IS  11 SN  10459219 SP1057 EP1072 EPD  10571072 A1  VenkataVasu Bokka, A1  Himabindu Gurla, A1  Stephan Olariu, A1  James L. Schwing, PY  1998 KW  Computeraided manufacturing KW  robotics KW  CAD KW  VLSI design KW  computeraided geometric design KW  constrained triangulations KW  reconfigurable meshes KW  constant time algorithms. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—A number of applications in computeraided manufacturing, CAD, and computeraided geometric design ask for triangulating pieces of material with defects. These tasks are known collectively as
[1] Surfaces in Computer Aided Geometric Design, R. Barnhill and W. Boehm, eds. Amsterdam: NorthHolland, 1983.
[2] Computer Aided Geometric Design, R. Barnhill and R. Riesenfeld, eds. New York: Academic Press, 1974.
[3] K.E. Batcher, "Design of Massively Parallel Processor," IEEE Trans. Computers, vol. 29, pp. 836840, 1980.
[4] K.E. Batcher, "STARAN Parallel Processor System Hardware," Proc. 1974 Nat'l Computer Conf., pp. 405410,Montvale, N.J., 1974.
[5] Y. BenAsher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139153, Oct. 1991.
[6] C.B. Besant, ComputerAided Design and Manufacture.New York: John Wiley and Sons, 1980.
[7] D. Bhagavathi, H. Gurla, S. Olariu, J.L. Schwing, and I. Stojmenovic, "TimeOptimal VisibilityRelated Algorithms on Meshes with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 6, pp. 687703, 1995.
[8] T. Blank, "The MasPar MP1 Architecture," IEEE Compcon, pp. 2024. IEEE, San Francisco, Feb./Mar. 1990.
[9] S. Bokhari, "On the Mapping Problem," IEEE Trans. Computers, vol. 30, pp. 207214, 1981.
[10] V. Bokka, H. Gurla, S. Olariu, and J.L. Schwing, "Constant Time Convexity Problems on Dense Reconfigurable Meshes," J. Parallel and Distributed Computing, vol. 27, pp. 8699, 1995.
[11] G.H. Chen, S. Olariu, J.L. Schwing, B.F. Wang, and J. Zhang, "ConstantTime Tree Algorithms on Reconfigurable Meshes," J. Parallel and Distributed Computing, vol. 26, pp. 137150, 1995.
[12] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis.New York: Wiley and Sons, 1973.
[13] J. Encarnacao and E.G. Schlechtendahl, Computer Aided Design.Berlin: SpringerVerlag, 1990.
[14] G. Farin, Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide. Academic Press, 1993.
[15] J. George, "Computer Inplementation of the Finite Element Method," doctoral dissertation, Stanford Univ., 1971.
[16] H. Gurla, "Leftmost One Computation on Meshes with Row Broadcasting," Information Processing Letters, vol. 47, pp. 261266, 1993.
[17] J. Jang, M. Nigam, V.K. Prasanna, and S. Sahni, “Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 1, pp. 1–12, Jan. 1997.
[18] J. Jang and V.K. Prasanna,“An optimal sorting algorithm on reconfigurable mesh,” Proc. Int’l Parallel Processing Symp., pp. 130137, Mar. 1992.
[19] T.H. Lai and M.J. Sheng, "Triangulation on Reconfigurable Meshes: A Natural Decomposition Approach," J. Parallel and Distributed Computing, to appear.
[20] J.P. Laumond, "Obstacle Growing in a NonPolygonal World," Information Processing Letters, vol. 25, pp. 4150, 1987.
[21] H. Li and M. Maresca,“Polymorphictorus network,” IEEE Trans. on Computers, vol. 38, no. 9, pp. 13451351, Sept. 1989.
[22] R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 93102, Jan. 1995.
[23] R. Lin, S. Olariu, J.L. Schwing, and J. Zhang, "Sorting in O(1) Time on a Reconfigurable Mesh of Size N×N," Parallel Computing: From Theory to Sound Practice, Proc. EWPC'92, Plenary Address, pp. 1627.Amsterdam: IOS Press, 1992.
[24] E. Lodi and L. Pagli, "A VLSI Solution to the Vertical Segment Visibility Problem," IEEE Trans. Computers, vol. 35, pp. 923928, 1986.
[25] Mathematical Methods in Computer Aided Geometric Design, T. Lyche and L.L. Schumaker, eds. New York: Academic Press, 1989.
[26] M. Maresca, "Polymorphic Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 490506, 1993.
[27] M. Maresca and H. Li,“Connection autonomy in SIMD computers: a VLSI implementation,”J. Parallel Distribut. Comput., vol. 7, pp. 302–320, 1989.
[28] M. Maresca, H. Li, and P. Baglietto, "Hardware Support for Fast Reconfigurability in Processor Arrays," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 282289,St. Charles, Ill., 1993.
[29] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678692, June 1993.
[30] R. Mills, "FiniteElement Modelers: Friendly Faces for FEA," ComputerAided Eng., pp. 3655, Mar. 1992.
[31] K. Nakano, "A Bibliography of Published Papers on Dynamically Reconfigurable Architectures," Parallel Processing Letters, vol. 5, pp. 111124, 1995.
[32] M. Nigam and S. Sahni, "Sorting n Numbers on n x n Reconfigurable Meshes With Buses," Proc. Int'l Parallel Processing Symp., pp. 174181, 1993.
[33] S. Olariu and J. Schwing, "A New Deterministic Sampling Scheme with Applications to BroadcastEfficient Sorting on the Reconfigurable Mesh," J. Parallel and Distributed Computing, vol. 32, pp. 215222, 1996.
[34] S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Data Movement for Reconfigurable Meshes," Int'l J. High Speed Computing, vol. 6, pp. 311323, 1994.
[35] S. Olariu, J.L. Schwing, and J. Zhang, "TimeOptimal Convex Hull Algorithms on Enhanced Meshes," BIT, vol. 33, pp. 396410, 1993.
[36] S. Olariu,J.L. Schwing,, and J. Zhang,“Fast computer vision algorithms for reconfigurable meshes,” Image and Vision Computing, pp. 610616, 1992.
[37] S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Algorithms on Reconfigurable Meshes," Proc. 29th Ann. Allerton Conf. Comm., Control, and Computing, pp. 811820, 1991.
[38] S. Olariu, J.L. Schwing, and J. Zhang, “A ConstantTime ChannelAssignment Algorithm on Reconfigurable Meshes,” BIT, vol. 32, pp. 586597, 1993.
[39] D. Parkinson, D.J. Hunt, and K.S. MacQueen, "The AMT DAP 500," Proc. 33rd IEEE CS Int'l Conf., pp. 196199 1988.
[40] T. Pavlidis, Computer Graphics.Potomac, Md.: Computer Science Press, 1978.
[41] J.L. Potter, The Massively Parallel Processor.Cambridge, Mass.: MIT Press, 1985.
[42] V.K. Prasanna Kumar, and C.S. Raghavendra,“Array processor with multiple broadcasting,” J. of Parallel and Distributed Computing, vol. 4, pp. 173190, 1987.
[43] Physical Design and Automation of VLSI Systems, B. Preas and M. Lorenzetti, eds. Menlo Park, Calif.: Benjamin/Cummings, 1988.
[44] J. Rothstein,“Bus Automata, Brains, and Mental Models,” IEEE Trans. on Systems, Man, and Cybernetics, vol. 18, no. 4, pp. 522531, Apr. 1988.
[45] A. Schuster PhD thesis, Hebrew Univ., Israel, 1991.
[46] D.B. Shu, L.W. Chow, and J.G. Nash, "A Content Addressable, Bit Serial Associate Processor," Proc. IEEE Workshop VLSI Signal Processing,Monterey Calif., Nov. 1988.
[47] D.B. Shu and J.G. Nash, "The Gated Interconnection Network for Dynamic Programming," Concurrent Computations, S.K. Tewsburg et al., eds. New York: Plenum, 1988.
[48] G. Strang and G. Fix, An Analysis of the Finite Element Method. Prentice Hall, 1973.
[49] C.W. Therrien, Decision Estimation and Classification: An Introduction to Pattern Recognition and Related Topics. John Wiley&Sons, 1989.
[50] G.T. Toussaint, "Movable Separability of Sets," Computational Geometry, G.T. Toussaint, ed. Amsterdam: Elsevier, NorthHolland, 1985.
[51] Computational Geometry, G.T. Toussaint, ed. Amsterdam: Elsevier Science, NorthHolland, 1985.
[52] G.T. Toussaint, Computational Morphology.Amsterdam: NorthHolland, 1988.
[53] C.A. Wang and Y.H. Tsin, "An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane," Information Processing Letters, vol. 25, pp. 5560, Apr. 1987.
[54] G.H. Chen and B.F. Wang, ”Sorting and Computing Convex Hulls on Processor Arrays with Reconfigurable Bus Systems,“ Information Sciences, An Int'l J., vol. 72, no. 3, pp. 191206, 1993.
[55] C.C. Weems, S.P. Levitan, A.R. Hanson, E.M. Riseman, J.G. Nash, and D.B. Sheu, "The Image Understanding Architecture," Int'l J. Computer Vision, vol. 2, pp. 251282, 1989.