Exploració per tema "Geometric constraint solving"
Ara es mostren els items 1-13 de 13
-
A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
(2017-03-01)
Article
Accés obertIn this work we describe an algorithm to generate tree-decomposable minimally rigid graphs on a given set of vertices V . The main idea is based on the well-known fact that all minimally rigid graphs, also known as Laman ... -
Combining constructive and equational geometric constraint solving techniques
(1997-09)
Report de recerca
Accés obertIn the past few years, there has been a strong trend towards developing parametric, computer aided design systems based on geometric constraint solving. An efective way to capture the design intent in these systems is ... -
Computing parameter ranges in constructive geometric constraint solving: A correctness proof
(2011)
Report de recerca
Accés obertIn parametric design, changing values of parameters to get different solution instances to the problem at hand is a paramount operation. One of the main issues when generating the solution instance for the actual set of ... -
Computing parameter ranges in constructive geometric constraint solving: Implementation and correctness proof
(Elsevier, 2012-07)
Article
Accés restringit per política de l'editorialIn parametric design, changing values of parameters to get different solution instances to the problem at hand is a paramount operation. One of the main issues when generating the solution instance for the actual set of ... -
Declarative characterization of a general architecture for constructive geometric constraint solvers
(2002-02)
Report de recerca
Accés obertGeometric constraint solving is a growing field devoted to solve geometric problems defined by relationships, called constraints, established between the geometric elements. There are several techniques to solve ... -
Decomposition of geometric constraint graphs based on computing fundamental circuits
(2007-09)
Report de recerca
Accés obertThe graph-based geometric constraint solving technique works in two steps. First the geometric problem is translated into a graph whose vertices represent de set of geometric elements and whose edges are the constraints. ... -
Decomposition of geometric constraint graphs based on computing fundamental circuits. Correctness and complexity
(2014-07-01)
Article
Accés restringit per política de l'editorialIn geometric constraint solving, Decomposition Recombination solvers (DR-solvers) refer to a general solving approach where the problem is divided into a set of sub-problems, each sub-problem is recursively divided until ... -
Dynamic geometry based on geometric constraints
(2007-07)
Report de recerca
Accés obertDynamic geometry systems are tools for geometric visualization. They allow the user to define geometric elements, establish relationships between them and explore the dynamic behavior of the remaining geometric elements ... -
h-graphs : a new representation for tree decompositions of graphs
(2015-10-01)
Article
Accés obertIn geometric constraint solving, 2D well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination ... -
h-graphs: A new representation for tree decompositions of graphs
(2014)
Report de recerca
Accés obertIn geometric constraint solving, well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination ... -
Parameter tuning for PBIL and CHC algorithms to solve the root identification problem in geometric constraint solving
(2007-01)
Report de recerca
Accés obertEvolutive algorithms are among the most successful approaches for solving a number of problems where systematic search in huge domains must be performed. One problem of practical interest that falls into this category is ... -
Predicción del rendimiento de CHC y PBIL aplicados al problema de la solución deseada
(2007-12)
Report de recerca
Accés obertEl incremento de la complejidad de las instancias del problema de la selección de la solución deseada en resolución de restricciones geométricas supone un aumento considerable del tiempo requerido por las diferentes ... -
Revisiting variable radius circles in constructive geometric constraint solving
(2002-03)
Report de recerca
Accés obertVariable-radius circles are common constructs in planar constraint solving and are usually not handled fully by algebraic constraint solvers. We give a complete treatment of variable-radius circles when such a circle must ...