Parallel algorithms on geometric constraint solving

Authors:
Jiang Kun;Gao Yang Lv Xingfeng;Zhan Yang
Affiliations:
Heilongjiang University, Harbin, China;HeiLongJiang University, Harbin, China;HeiLongJiang University, Harbin, China
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 5
Cited 0

Algebraic solution for geometry from dimensional constraints

SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Reasoning about naming systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructing three-dimensional geometric objects defined by constraints

I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
A systematic framework for solving geometric constraints analytically

Journal of Symbolic Computation
Variational geometry in computer-aided design

SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we try to speed up geometric constraint solving with parallel techniques. We propose parallel algorithms for building rule-bases, judging the under(over)-constrained problems, and finding construction sequences of geometric constraint problems. Experiment results show that the parallel algorithm can improve the efficiency of geometric constraint solving.