{"title":"带总线的可重构网格的三角剖分","authors":"M. Nigam, S. Sahni","doi":"10.1109/ICPP.1994.193","DOIUrl":null,"url":null,"abstract":"We develop an 0(1) time algorithm to a triangulate a set of N planar points using an N¿N reconfigurable mesh with buses. Our algorithm works on all reconfigurable mesh with buses architectures.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Triangulation on a Reconfigurable Mesh with Buses\",\"authors\":\"M. Nigam, S. Sahni\",\"doi\":\"10.1109/ICPP.1994.193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop an 0(1) time algorithm to a triangulate a set of N planar points using an N¿N reconfigurable mesh with buses. Our algorithm works on all reconfigurable mesh with buses architectures.\",\"PeriodicalId\":162043,\"journal\":{\"name\":\"1994 International Conference on Parallel Processing Vol. 3\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 International Conference on Parallel Processing Vol. 3\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.1994.193\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 International Conference on Parallel Processing Vol. 3","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.1994.193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We develop an 0(1) time algorithm to a triangulate a set of N planar points using an N¿N reconfigurable mesh with buses. Our algorithm works on all reconfigurable mesh with buses architectures.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
