Browsing by Author "Joan Arinyo, Robert"

Geometric constraint graphs decomposition based on computing graph circuits
Joan Arinyo, Robert; Tarres Puertas, Marta Isabel; Vila Marta, Sebastià (Copicentro, 20100101)
Part of book or chapter of book
Open AccessGeometric constraint solving is a growing field which plays a paramount role in industrial applications and that is deeply rooted in automated deduction in geometry. In this work we report on an algorithm to solve ... 
Geometric constraint problems and solution instances
Hidalgo Garcia, Marta; Joan Arinyo, Robert; Soto Riera, Antoni (201005)
External research report
Open AccessGeometric constraint solving is a growing field devoted to solve geometric problems defined by relationships, called constraints, established between the geometric elements. In this work we show that what characterizes a ... 
hgraphs : a new representation for tree decompositions of graphs
Hidalgo Garcia, Marta; Joan Arinyo, Robert (20151001)
Article
Open AccessIn geometric constraint solving, 2D well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraintbased geometric problem can be solved by a DecompositionRecombination ... 
hgraphs: A new representation for tree decompositions of graphs
Hidalgo Garcia, Marta; Joan Arinyo, Robert (2014)
External research report
Open AccessIn geometric constraint solving, well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraintbased geometric problem can be solved by a DecompositionRecombination ... 
Interval analysis applied to constraint feasibility in geometric constraint solving
Joan Arinyo, Robert; Mata Burgarolas, Nuria (199801)
External research report
Open AccessIn design and manufacturing applications, users of computer aided design systems are very often interested in knowing the range of values for some dimensions that define the object under design. This work reports on ... 
Interval methods for constructive geometric constraint solving problems
Joan Arinyo, Robert; Mata, Núria; Soto Riera, Antoni (200201)
External research report
Open AccessIn advanced computeraided design systems, an object is defined by a collection of geometric elements along with a set of geometric constraints between them. Given the values assigned to the constraint parameters, ... 
Isothetic polyhedra and monotone boolean formulae
Joan Arinyo, Robert (199401)
External research report
Open AccessWe consider the problem of converting boundary representations of isothetic polyhedra into constructive solid geometry (CSG) representations. The CSG representation is a boolean formula based on the halfspaces supporting ... 
Modelo interactivo híbrido de la dinámica de una torre de destilación
Joan Arinyo, Robert; Fernández, Rubén O. (Asociación Española de Informática y Automática (AEIA), 1979)
Conference report
Open AccessSe presenta un modelo interactivo híbrido en tiempo real para el estudio de los transitorios de concentración y de temperatura de una torre de destilación en producción contínua en respuesta a perturbaciones introducidas ... 
Multiresolution approximation of polyhedral solids
Ayala Vallespí, M. Dolors; Brunet Crosa, Pere; Joan Arinyo, Robert; Navazo Álvaro, Isabel (199606)
External research report
Open AccessMultiresolution models with different levels of detail are a basic tool for handling very large and complex systems in computer aided design applications such as ship design. In this work, we discuss several automatic ... 
Navigating large terrains using commodity mobile devices
Noguera, José María; Segura, Rafael; Ogáyar, Carlos; Joan Arinyo, Robert (201109)
Article
Restricted access  publisher's policy 
On the integration of CAD and CAE
Hoffmann, C M; Joan Arinyo, Robert (199410)
External research report
Open AccessThe principal problem that must be solved when integrating CAD and CAE is to devise an algorithmic exchange of information between the two subsystems. Elsewhere, we have argued that higherlevel representations can be ... 
On tree decomposability of Henneberg graphs
Hidalgo, Marta R.; Joan Arinyo, Robert (2014)
External research report
Open AccessIn this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the treedecomposition constructive technique. The algorithm is based on Henneberg constructions and ... 
On userdefined features
Christoph, Hoffmann M; Joan Arinyo, Robert (199610)
External research report
Open AccessFeaturebased design is becoming one of the basic design paradigms of CAD systems. In this paradigm the basic unit is a feature and parts are constructed from a sequence of feature attachment operations. The type and ... 
Ordering triangles in triangulated terrains over regular grids
Joan Arinyo, Robert; Alonso Alonso, Jesús (2016)
Conference report
Restricted access  publisher's policyIn this work we report on a set of rules to visit triangles in triangulated height fields defined over regular grids in a backto front order with respect to an arbitrary viewpoint. With the viewpoint, we associate an ... 
Parameter tuning for PBIL and CHC algorithms to solve the root identification problem in geometric constraint solving
Joan Arinyo, Robert; Luzón, M.V.; Yeguas, E. (200701)
External research report
Open AccessEvolutive 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 ... 
Parameter tunning for PBIL algorithm in geometric constraint solving systems
Joan Arinyo, Robert; Luzón, M.V.; YEGUAS BOLÍAVAR, ENRIQUE (20080814)
Conference report
Open AccessIn previous works we have shown that applying genetic algorithms to solve the Root Identification Problem is feasible and effective. The behavior of evolutive algorithms is characterized by a set of parameters that have ... 
Parameter tunning of PBIL and CHC evolutionary algorithms applied to solve the Root Identification Problem
Joan Arinyo, Robert; Luzón, M.V.; Yeguas Bolívar, Enrique (20091201)
Article
Restricted access  publisher's policyEvolutionary algorithms are among the most successful approaches for solving a number of problems where systematic searches in huge domains must be performed. One problem of practical interest that falls into this category ... 
Predicción del rendimiento de CHC y PBIL aplicados al problema de la solución deseada
Joan Arinyo, Robert; Luzón, M.V.; Yeguas, E. (200712)
External research report
Open AccessEl 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 decomposition analysis of geometric constraint graphs
Joan Arinyo, Robert; Soto Riera, Antoni; Vila Marta, Sebastià; Vilaplana Pastó, Josep (200202)
External research report
Open AccessGeometric problems defined by constraints can be represented by geometric constraint graphs whose nodes are geometric elements and whose arcs represent geometric constraints. Reduction and decomposition are techniques ... 
Revisiting variable radius circles in constructive geometric constraint solving
ChingShoei, C; Joan Arinyo, Robert (200203)
External research report
Open AccessVariableradius circles are common constructs in planar constraint solving and are usually not handled fully by algebraic constraint solvers. We give a complete treatment of variableradius circles when such a circle must ...