• español
    • English
  • Self-archive
  • Browse
    • Communities & Collections
    • By Issue Date
    • Authors
    • Titles
    • Subjects
    • Document types
  • English 
    • español
    • English
  • Help
  • Login
 
View Item 
  •   Repositorio Institucional Universidad EAFIT
  • Investigación
  • Escuela de Ingeniería
  • Laboratorio CAD/CAM/CAE
  • Artículos
  • View Item
  •   Repositorio Institucional Universidad EAFIT
  • Investigación
  • Escuela de Ingeniería
  • Laboratorio CAD/CAM/CAE
  • Artículos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms

Thumbnail
View/Open
geometricConstraintSubsetsandSubgraphsintheAnalisys.pdf (314.0Kb)
Date
2006-03
Author
Ruíz, Óscar E.
Ferreira, Placid M.
Metrics
Metadata
Show full item record
Abstract
Geometric Reasoning ability is central to many applications in CAD/CAM/CAPP environments -- An increasing demand exists for Geometric Reasoning systems which evaluate the feasibility of virtual scenes specified by geometric relations -- Thus, the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF) problem consists of a basic scenario containing geometric entities, whose context is used to propose constraining relations among still undefined entities -- If the constraint specification is consistent, the answer of the problem is one of finitely or infinitely many solution scenarios satisfying the prescribed constraints -- Otherwise, a diagnostic of inconsistency is expected -- The three main approaches used for this problem are numerical, procedural or operational and mathematical -- Numerical and procedural approaches answer only part of the problem, and are not complete in the sense that a failure to provide an answer does not preclude the existence of one -- The mathematical approach previously presented by the authors describes the problem using a set of polynomial equations -- The common roots to this set of polynomials characterizes the solution space for such a problem -- That work presents the use of Groebner basis techniques for verifying the consistency of the constraints -- It also integrates subgroups of the Special Euclidean Group of Displacements SE(3) in the problem formulation to exploit the structure implied by geometric relations -- Although theoretically sound, these techniques require large amounts of computing resources -- This work proposes Divide-and-Conquer techniques applied to local GCS/SF subproblems to identify strongly constrained clusters of geometric entities -- The identification and preprocessing of these clusters generally reduces the effort required in solving the overall problem -- Cluster identification can be related to identifying short cycles in the Spatial Con straint graph for the GCS/SF problem -- Their preprocessing uses the aforementioned Algebraic Geometry and Group theoretical techniques on the local GCS/SF problems that correspond to these cycles -- Besides improving theefficiency of the solution approach, the Divide-and-Conquer techniques capture the physical essence of the problem -- This is illustrated by applying the discussed techniques to the analysis of the degrees of freedom of mechanisms
Documents PDF

loading
URI
http://hdl.handle.net/10784/9691
Editor URL
Ingeniería y Ciencia, Volume 2, Issue 3, pp. 103-137
Collections
  • Artículos [45]

My Account

LoginRegister

Statistics

View Usage Statistics

universidad eafit medellin repositorio institucional

Vigilada Mineducación
Universidad con Acreditación Institucional hasta 2026
Resolución MEN 2158 de 2018

Líneas de Atención

Medellín: (57) (4) - 448 95 00
Resto del país: 01 8000 515 900
Conmutador: (57) (4) - 2619500
Carrera 49 N 7 Sur - 50
Medellín, Colombia, Suramérica

Derechos Reservados

DSpace software
copyright © 2002-2016 
Duraspace

Theme by 
@mire NV