J. D. Loera, Brandon E. Dutra, M. Köppe, Stanislav Moreinis, Gregory Pinto, Jianqiu Wu
{"title":"软件的精确积分多项式在多面体","authors":"J. D. Loera, Brandon E. Dutra, M. Köppe, Stanislav Moreinis, Gregory Pinto, Jianqiu Wu","doi":"10.1145/2110170.2110175","DOIUrl":null,"url":null,"abstract":"We are interested in quickly computing the exact value of integrals of polynomial functions over domains that are decomposable into convex polyhedra (e.g., a tetrahedral or cubical mesh decomposition of space). We describe a software implementation, part of the software LattE, and provide benchmark computations.","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"6 1","pages":"232-252"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"80","resultStr":"{\"title\":\"Software for exact integration of polynomials over polyhedra\",\"authors\":\"J. D. Loera, Brandon E. Dutra, M. Köppe, Stanislav Moreinis, Gregory Pinto, Jianqiu Wu\",\"doi\":\"10.1145/2110170.2110175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We are interested in quickly computing the exact value of integrals of polynomial functions over domains that are decomposable into convex polyhedra (e.g., a tetrahedral or cubical mesh decomposition of space). We describe a software implementation, part of the software LattE, and provide benchmark computations.\",\"PeriodicalId\":11245,\"journal\":{\"name\":\"Discret. Comput. Geom.\",\"volume\":\"6 1\",\"pages\":\"232-252\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"80\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Comput. Geom.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2110170.2110175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Comput. Geom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2110170.2110175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Software for exact integration of polynomials over polyhedra
We are interested in quickly computing the exact value of integrals of polynomial functions over domains that are decomposable into convex polyhedra (e.g., a tetrahedral or cubical mesh decomposition of space). We describe a software implementation, part of the software LattE, and provide benchmark computations.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
