{"title":"用轨迹交求解空间基本几何约束构型","authors":"X. Gao, C. Hoffmann, Wei-Qiang Yang","doi":"10.1145/566282.566299","DOIUrl":null,"url":null,"abstract":"A basic idea of geometric constraint solving is to decompose the constraint problem into smaller ones according to some basic configurations. In this paper, we find all spatial basic configurations involving points, lines, and planes containing up to six geometric primitives in an automated way. Many of these basic configurations still resist effective analytical solutions. We propose the locus intersection method for geometric constraint solving, which is used to solve all these basic configurations.","PeriodicalId":286112,"journal":{"name":"International Conference on Smart Media and Applications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"62","resultStr":"{\"title\":\"Solving spatial basic geometric constraint configurations with locus intersection\",\"authors\":\"X. Gao, C. Hoffmann, Wei-Qiang Yang\",\"doi\":\"10.1145/566282.566299\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A basic idea of geometric constraint solving is to decompose the constraint problem into smaller ones according to some basic configurations. In this paper, we find all spatial basic configurations involving points, lines, and planes containing up to six geometric primitives in an automated way. Many of these basic configurations still resist effective analytical solutions. We propose the locus intersection method for geometric constraint solving, which is used to solve all these basic configurations.\",\"PeriodicalId\":286112,\"journal\":{\"name\":\"International Conference on Smart Media and Applications\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"62\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Smart Media and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/566282.566299\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Smart Media and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/566282.566299","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving spatial basic geometric constraint configurations with locus intersection
A basic idea of geometric constraint solving is to decompose the constraint problem into smaller ones according to some basic configurations. In this paper, we find all spatial basic configurations involving points, lines, and planes containing up to six geometric primitives in an automated way. Many of these basic configurations still resist effective analytical solutions. We propose the locus intersection method for geometric constraint solving, which is used to solve all these basic configurations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
