{"title":"计算分段卷","authors":"G. Nielson, R. Franke","doi":"10.1109/DAGSTUHL.1997.1423120","DOIUrl":null,"url":null,"abstract":"An algorithm for computing a representation for sub-volumes that segment space into different classifications is given. The starting point is a tetrahedrization of a set of scattered points in space, each with a classification associated with it. The algorithm then marches from tetrahedron to tetrahedron to generate the representation in terms of sub-tetrahedra. The algorithm is very simple and independent of the number of the number of different classifications of points.","PeriodicalId":268314,"journal":{"name":"Scientific Visualization Conference (dagstuhl '97)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Computing Segmented Volumes\",\"authors\":\"G. Nielson, R. Franke\",\"doi\":\"10.1109/DAGSTUHL.1997.1423120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm for computing a representation for sub-volumes that segment space into different classifications is given. The starting point is a tetrahedrization of a set of scattered points in space, each with a classification associated with it. The algorithm then marches from tetrahedron to tetrahedron to generate the representation in terms of sub-tetrahedra. The algorithm is very simple and independent of the number of the number of different classifications of points.\",\"PeriodicalId\":268314,\"journal\":{\"name\":\"Scientific Visualization Conference (dagstuhl '97)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scientific Visualization Conference (dagstuhl '97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAGSTUHL.1997.1423120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scientific Visualization Conference (dagstuhl '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAGSTUHL.1997.1423120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An algorithm for computing a representation for sub-volumes that segment space into different classifications is given. The starting point is a tetrahedrization of a set of scattered points in space, each with a classification associated with it. The algorithm then marches from tetrahedron to tetrahedron to generate the representation in terms of sub-tetrahedra. The algorithm is very simple and independent of the number of the number of different classifications of points.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
