20.500.12556/DKUM-26148 Dealing with redundancy and inconsistency in constructive geometric constraint solving General constructive geometric constraint solvers are pre-processed by a degree-of-freedom analysis, which enables efficient graph decomposition and recombination. However, all these methods are based on the assumption that structural rigidity automatically assures solvability. In this paper, we show that this assumption fails in numerous, even the most basic, configurations. We introduce several simple but efficient rules aimed to additionally analyse solvability in such cases. Another novelty addresses conditional constraints between three or more geometric parts, rules for their simplification and a redundancy check. All these functionalities are built into our original 2D geometric constraint solver, based on concepts of rigid clusters and constrained-angle (CA) sets. geometric constraint solving computer-aided design constructive approach redundant constraints true false false Angleški jezik Angleški jezik Neznano 2012-05-31 12:02:12 2012-05-31 12:02:12 2022-04-15 03:40:56 2024-01-03 03:20:28 2008 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.9 12138006 0965-9978 URN:SI:UM:DK:K4KY4P5A http://dx.doi.org/10.1016/j.advengsoft.2007.10.003 1 https://dk.um.si/Dokument.php?lang=slv&id=35083 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0