Název:	A geometric constraint solver with decomposable constraint set
Autoři:	Podgorelec, David Žalik, Borut
Citace zdrojového dokumentu:	Journal of WSCG. 2001, vol. 9, no. 1-3.
Datum vydání:	2001
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	článek article
URI:	http://hdl.handle.net/11025/15791 http://wscg.zcu.cz/wscg2001/WSCG2001_Program.htm
ISSN:	1213-6972 (print) 1213-6980 (CD-ROM) 1213-6964 (online)
Klíčová slova:	CAD;design založený na omezení;geometrická omezení;geometrické modelování
Klíčová slova v dalším jazyce:	CAD;constraint-based design;geometric constraints;geometric modelling
Abstrakt v dalším jazyce:	In the paper, a new constructive approach to solving geometric constraints in 2D space is presented. The main step of the algorithm is pre-processing, which transforms both, geometric elements and geometric constraints, into simpler forms, and adds redundant constraints of distances and angles by solving triangles and determining sums and differences of adjacent angles. A wide variety of wellconstrained problems can then be solved by a simple technique of local propagation, and over-constrained scenes and input data contradictory to some well-known mathematical theorems can also be detected in the same phase. Only with under-constrained problems and some special well-constrained cases, an additional step of merging clusters and/or geometrical relaxation is required.
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	Volume 9, number 1-3 (2001)

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.