{"title":"Constructing the city Voronoi diagram faster","authors":"Robert Görke, C. Shin, A. Wolff","doi":"10.1142/S0218195908002623","DOIUrl":"https://doi.org/10.1142/S0218195908002623","url":null,"abstract":"A rug cleaning attachment for a vacuum cleaner is disclosed. The attachment has a suds confining chamber and a scrubbing brush roll mounted thereon for rotation about a horizontal axis within the chamber. The brush roll has a multiplicity of tufts which are adapted to scrub suds into the rug and which define a cylindrical envelope upon rotation of the brush roll. A shield closely conforms to the cylindrical element and guards against suds being centrifugally thrown into the drive and/or suction components of the vacuum cleaner. A scalloped doctor blade is provided for the brush roll which projects into the cylindrical envelope defined by the tufts to scrape spent suds and lint from the brush roll.","PeriodicalId":243365,"journal":{"name":"European Workshop on Computational Geometry","volume":"482 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133486068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Benkert, Joachim Gudmundsson, H. Haverkort, A. Wolff
{"title":"Constructing interference-minimal networks","authors":"M. Benkert, Joachim Gudmundsson, H. Haverkort, A. Wolff","doi":"10.1007/11611257_14","DOIUrl":"https://doi.org/10.1007/11611257_14","url":null,"abstract":"","PeriodicalId":243365,"journal":{"name":"European Workshop on Computational Geometry","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The minimum area spanning tree problem","authors":"Paz Carmi, M. J. Katz, Joseph S. B. Mitchell","doi":"10.1007/11534273_18","DOIUrl":"https://doi.org/10.1007/11534273_18","url":null,"abstract":"","PeriodicalId":243365,"journal":{"name":"European Workshop on Computational Geometry","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116593156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On computing Fréchet distance of two paths on a convex polyhedron","authors":"A. Maheshwari, Jiehua Yi","doi":"10.22215/etd/2004-06003","DOIUrl":"https://doi.org/10.22215/etd/2004-06003","url":null,"abstract":"We present a polynomial time algorithm for computing Frechet distance between two simple paths on the surface of a convex polyhedron.","PeriodicalId":243365,"journal":{"name":"European Workshop on Computational Geometry","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131826744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Approximation schemes for the generalized geometric problems with geographic clustering","authors":"C. Feremans, A. Grigoriev","doi":"10.26481/umamet.2004034","DOIUrl":"https://doi.org/10.26481/umamet.2004034","url":null,"abstract":"This paper is concerned with polynomial time approximations schemes for the generalized geometric problems with geographic clustering. We illustrate the approach on the generalized traveling salesman problem which is also known as Group-TSP or TSP with neighborhoods. We prove that under the condition that all regions are non-intersecting and have comparable sizes and shapes, the problem admits PTAS. To derive a PTAS we extend the algorithm by Arora [2]. This extension involves the dissection mechanism and solution of the selection problem. We observe that the results are applicable to many generalized geometric problems, to other Minkowski norms, and to other ¯xed dimensional spaces.","PeriodicalId":243365,"journal":{"name":"European Workshop on Computational Geometry","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117288069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：