Now showing items 41-60 of 76

  • Geometric constraint graphs decomposition based on computing graph circuits 

    Joan Arinyo, Robert; Tarres Puertas, Marta Isabel; Vila Marta, Sebastià (Copicentro, 2010-01-01)
    Part of book or chapter of book
    Open Access
    Geometric 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 (2010-05)
    External research report
    Open Access
    Geometric 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 ...
  • h-graphs : a new representation for tree decompositions of graphs 

    Hidalgo Garcia, Marta; Joan Arinyo, Robert (2015-10-01)
    Article
    Open Access
    In 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 

    Hidalgo Garcia, Marta; Joan Arinyo, Robert (2014)
    External research report
    Open Access
    In 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 ...
  • Interval analysis applied to constraint feasibility in geometric constraint solving 

    Joan Arinyo, Robert; Mata Burgarolas, Nuria (1998-01)
    External research report
    Open Access
    In 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 (2002-01)
    External research report
    Open Access
    In advanced computer-aided 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 (1994-01)
    External research report
    Open Access
    We 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 Access
    Se 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 (1996-06)
    External research report
    Open Access
    Multiresolution 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 (2011-09)
    Article
    Restricted access - publisher's policy
  • On the integration of CAD and CAE 

    Hoffmann, C M; Joan Arinyo, Robert (1994-10)
    External research report
    Open Access
    The 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 higher-level representations can be ...
  • On tree decomposability of Henneberg graphs 

    Hidalgo, Marta R.; Joan Arinyo, Robert (2014)
    External research report
    Open Access
    In this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the tree-decomposition constructive technique. The algorithm is based on Henneberg constructions and ...
  • On user-defined features 

    Christoph, Hoffmann M; Joan Arinyo, Robert (1996-10)
    External research report
    Open Access
    Feature-based 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 policy
    In this work we report on a set of rules to visit triangles in triangulated height fields defined over regular grids in a back-to- 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. (2007-01)
    External research report
    Open Access
    Evolutive 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 (2008-08-14)
    Conference report
    Open Access
    In 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 (2009-12-01)
    Article
    Restricted access - publisher's policy
    Evolutionary 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. (2007-12)
    External research report
    Open Access
    El 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 (2002-02)
    External research report
    Open Access
    Geometric 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 

    Ching-Shoei, C; Joan Arinyo, Robert (2002-03)
    External research report
    Open Access
    Variable-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 ...