一种新的完全投影 O(lg N) 线凸多边形相交算法

{"title":"一种新的完全投影 O(lg N) 线凸多边形相交算法","authors":"Vaclav Skala","doi":"10.1007/s00371-024-03413-3","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":227044,"journal":{"name":"The Visual Computer","volume":"171 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A new fully projective O(lg N) line convex polygon intersection algorithm\",\"authors\":\"Vaclav Skala\",\"doi\":\"10.1007/s00371-024-03413-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":227044,\"journal\":{\"name\":\"The Visual Computer\",\"volume\":\"171 4\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Visual Computer\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s00371-024-03413-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Visual Computer","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00371-024-03413-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}