<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-13T16:53:16Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/97568" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/97568</identifier><datestamp>2025-07-17T00:20:12Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Declarative characterization of a general architecture for constructive geometric constraint solvers</dc:title>
   <dc:creator>Joan Arinyo, Robert</dc:creator>
   <dc:creator>Soto Riera, Antoni</dc:creator>
   <dc:creator>Vila Marta, Sebastià</dc:creator>
   <dc:creator>Vilaplana Pastó, Josep</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament d'Enginyeria Minera, Industrial i TIC</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Ciències de la Computació</dc:contributor>
   <dc:subject>Àrees temàtiques de la UPC::Informàtica</dc:subject>
   <dc:subject>Geometric constraint solving</dc:subject>
   <dc:subject>Constructive geometric constraint solvers</dc:subject>
   <dc:description>Geometric constraint solving is a growing field devoted to solve&#xd;
  geometric problems defined by relationships, called constraints,&#xd;
  established between the geometric elements.  There are several&#xd;
  techniques to solve geometric constraint problems.  In this work we&#xd;
  focus on the Constructive technique.  Usually, it works in two&#xd;
  steps. In a first step, the problem is analyzed symbolically. If the&#xd;
  problem is solvable by the technique, the output is the construction&#xd;
  plan, that is, a sequence of abstract geometric constructions which&#xd;
  defines parametrically the solution to the problem.  Then, the&#xd;
  construction plan is applied to a set of specific values assigned to&#xd;
  the parameters. If no numerical incompatibilities arise, instances&#xd;
  of the solution are generated.&#xd;
  &#xd;
  In this paper we present a general architecture for constructive&#xd;
  geometric constraint solvers.  The basic components of this&#xd;
  architecture are three functional units: the analyzer, the index&#xd;
  selector and the constructor. Each functional unit is specified in&#xd;
  terms of the entities that manipulates such as geometric constraint&#xd;
  problems and construction plans.  These relevant entities are&#xd;
  declaratively characterized and its precise semantic is stated.</dc:description>
   <dc:description>Postprint (published version)</dc:description>
   <dc:date>2002-02</dc:date>
   <dc:type>External research report</dc:type>
   <dc:identifier>Joan-Arinyo, R., Soto-Riera, A., Vila-Marta, S., Vilaplana, J. "Declarative characterization of a general architecture for constructive geometric constraint solvers". 2002.</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/97568</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>LSI-02-12</dc:relation>
   <dc:rights>Open Access</dc:rights>
   <dc:format>9 p.</dc:format>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>