Title: A geometric constraint solver with decomposable constraint set
Authors: Podgorelec, David
Žalik, Borut
Citation: Journal of WSCG. 2001, vol. 9, no. 1-3.
Issue Date: 2001
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://hdl.handle.net/11025/15791
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: CAD;design založený na omezení;geometrická omezení;geometrické modelování
Keywords in different language: CAD;constraint-based design;geometric constraints;geometric modelling
Abstract in different language: 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.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 9, number 1-3 (2001)

Files in This Item:
File Description SizeFormat 
R372.pdfPlný text186,02 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/15791

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.