Robust Geometric Modeling Free From Computational Errors
Project/Area Number  06650182 
Research Category 
GrantinAid for Scientific Research (C).

Research Field 
設計工学・機械要素・トライボロジー

Research Institution  Toyota Technological Institute 
Principal Investigator 
HIGASHI Masatake Faculty of Engineering, Toyota Technological Institute Professor, 工学部, 教授 (70189752)

Project Fiscal Year 
1994 – 1995

Project Status 
Completed(Fiscal Year 1995)

Budget Amount *help 
¥1,400,000 (Direct Cost : ¥1,400,000)
Fiscal Year 1995 : ¥300,000 (Direct Cost : ¥300,000)
Fiscal Year 1994 : ¥1,100,000 (Direct Cost : ¥1,100,000)

Keywords  Geometric Modeling / Computational Error / FaceBased Data Structure / Set Operation / Interference Calculation / Topological Structure / 形状モデリング / 計算誤差 / 面ベースデータ構造 / 集合演算 / 干渉計算 / 位相構造 / 干渉演算 
Research Abstract 
In order to make a robust geometric modeling system by eliminating instability caused by computational errors, we have established algorithms of processing polyhedra for an introduced facebased data structure, and then extended them to curved objects. In the algorithms for polyhedra, since inconsistency between geometry and topology occurs at the degeneracy of geometric elements such as vertices, edges and faces, we have introduced a criterion of incidence among them. It is the minimum height of a tetrahedron which is calculated using a determinant value from four plane equations. Combining incidence tests, we obtained their incidence patterns. We get a global topological structure from the interference loop for the set operation and feature operation. At the degeneracy for a vertex, we trace the intersection by the sector test for the face segments there. To prevent the accumulation of errors for the ambiguous shape around the vertex and to keep consistency of the topology, we have in
… More
troduced an algorithm to determine the local topology which is represented as a tree structure not to make small faces. Since we cannot calculate the minimum distance of the tetrahedron from the determinant for curved faces, we have to calculate a foot leng of perpendicular from an intersection point of three faces to a face and consider tangency between faces, a face and a curve and a curve and a curve. We have developed algorithms for an intersection point of three faces, a perpendicular from a point to a face, a minimum distance position of two faces, and a minimum distance position between a boundary and an intersection. Then, combining them, we determine the patterns of the degeneracy. We have examined methods for detecting and connecting the intersection points which do not make a loop because of errors. We have shown an algorithm to determine the local topology of the ambiguous shape around the vertex for a curved solid as similarly as for a polyhedron. Our future research is to confirm the algorithms by experiments on a system. Less

Report
(4results)
Research Output
(6results)