
	Information Technology Journal
	Year: 2011 \| Volume: 10 \| Issue: 7 \| Page No.: 1447-1451 DOI: 10.3923/itj.2011.1447.1451

An Expanding Algorithm of Geometric Constraint Solving in Semantic Feature Modeling

Xianguo Liu and Lijuan Sun

Abstract: A new solving approach for constraint problem was proposed in this study, the constraint problem needed to solve was decomposed not into single sub-problems but into three types of sub-problems, namely, rigid subset, scalable subset and radial subset and each type of subset corresponds a cluster of constraint problem. Based on cluster rewriting rule approach, a small set of rewriting rules were applied in constraint system and an incremental algorithm was presented, the solving approach could get the generic solution when no available rewriting rule was available. By this approach, we can determine that constraint system is well-constrained, under-constrained or over-constrained. The results reveal that the proposed method can efficiently process constraint problem.

PDF Fulltext XML References Citation Report Citation

RELATED ARTICLES:

•	Constraint Conversion Method in Feature-Based Heterogeneous CAD Model Exchange

•	Ontology-Based Model for Software Resources Interoperability

•	Ontology-based Semantic Interoperability among Heterogeneous CAD Systems

•	Research on Cube-based Boolean Operation in Cellular Semantic Feature Modeling System

How to cite this article:

Xianguo Liu and Lijuan Sun, 2011. An Expanding Algorithm of Geometric Constraint Solving in Semantic Feature Modeling. Information Technology Journal, 10: 1447-1451.

DOI: 10.3923/itj.2011.1447.1451

URL: https://scialert.net/abstract/?doi=itj.2011.1447.1451

COMMENT ON THIS PAPER

Navigation


		Online First
		Current Issue
		Previous Issues
		Editorial Board
		Submit a Manuscript
		Guide to Authors
		Subscribe to E-alerts

Indexed In


		ASCI-Database
		Asian Digital Library
		Google Scholar

Science Alert