Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar Linkages

In the study and design of planar mechanisms, graphical techniques for solving kinematic analysis/synthesis and kinetostatics problems have regained interest due to the availability of advanced drawing tools (e.g., CAD software). These techniques offer a deeper physical understanding of a mechanism’...

Full description

Saved in:
Bibliographic Details
Main Authors: Raffaele Di Gregorio, Tommaso Cinti
Format: Article
Language:English
Published: MDPI AG 2024-11-01
Series:Machines
Subjects:
Online Access:https://www.mdpi.com/2075-1702/12/11/825
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1846153113269960704
author Raffaele Di Gregorio
Tommaso Cinti
author_facet Raffaele Di Gregorio
Tommaso Cinti
author_sort Raffaele Di Gregorio
collection DOAJ
description In the study and design of planar mechanisms, graphical techniques for solving kinematic analysis/synthesis and kinetostatics problems have regained interest due to the availability of advanced drawing tools (e.g., CAD software). These techniques offer a deeper physical understanding of a mechanism’s behavior, which can enhance a designer’s intuition and help students develop their skills. Geometric Constraint Programming (GCP) is the term used to describe this modern approach to implementing these techniques. GeoGebra is an open-source platform designed for the interactive learning and teaching of mathematics and related STEM disciplines. It offers an object-oriented programming language and a wide range of geometric tools that can be leveraged to implement GCP. This work presents a systematic technique for studying and designing planar linkages, based on Assur’s groups and GeoGebra’s tools. Although some kinematic analyses and syntheses of planar linkages using GeoGebra have been previously introduced, the proposed systematic approach is novel and could serve as a guide for implementing similar problem-solving methods in other graphical environments. Several case studies will be presented to illustrate this novel approach in detail.
format Article
id doaj-art-f70b72af7b3e43c695489d68e23bc7b2
institution Kabale University
issn 2075-1702
language English
publishDate 2024-11-01
publisher MDPI AG
record_format Article
series Machines
spelling doaj-art-f70b72af7b3e43c695489d68e23bc7b22024-11-26T18:11:13ZengMDPI AGMachines2075-17022024-11-01121182510.3390/machines12110825Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar LinkagesRaffaele Di Gregorio0Tommaso Cinti1Laboratory of Mechatronics and Virtual Prototyping (LaMaViP), Department of Engineering, University of Ferrara, Via Saragat 1, 44122 Ferrara, ItalyLaboratory of Mechatronics and Virtual Prototyping (LaMaViP), Department of Engineering, University of Ferrara, Via Saragat 1, 44122 Ferrara, ItalyIn the study and design of planar mechanisms, graphical techniques for solving kinematic analysis/synthesis and kinetostatics problems have regained interest due to the availability of advanced drawing tools (e.g., CAD software). These techniques offer a deeper physical understanding of a mechanism’s behavior, which can enhance a designer’s intuition and help students develop their skills. Geometric Constraint Programming (GCP) is the term used to describe this modern approach to implementing these techniques. GeoGebra is an open-source platform designed for the interactive learning and teaching of mathematics and related STEM disciplines. It offers an object-oriented programming language and a wide range of geometric tools that can be leveraged to implement GCP. This work presents a systematic technique for studying and designing planar linkages, based on Assur’s groups and GeoGebra’s tools. Although some kinematic analyses and syntheses of planar linkages using GeoGebra have been previously introduced, the proposed systematic approach is novel and could serve as a guide for implementing similar problem-solving methods in other graphical environments. Several case studies will be presented to illustrate this novel approach in detail.https://www.mdpi.com/2075-1702/12/11/825planar linkagekinematicskinetostaticsparametric modelinggeometric constraint programmingAssur group
spellingShingle Raffaele Di Gregorio
Tommaso Cinti
Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar Linkages
Machines
planar linkage
kinematics
kinetostatics
parametric modeling
geometric constraint programming
Assur group
title Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar Linkages
title_full Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar Linkages
title_fullStr Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar Linkages
title_full_unstemmed Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar Linkages
title_short Geometric Constraint Programming (GCP) Implemented Through GeoGebra to Study/Design Planar Linkages
title_sort geometric constraint programming gcp implemented through geogebra to study design planar linkages
topic planar linkage
kinematics
kinetostatics
parametric modeling
geometric constraint programming
Assur group
url https://www.mdpi.com/2075-1702/12/11/825
work_keys_str_mv AT raffaeledigregorio geometricconstraintprogramminggcpimplementedthroughgeogebratostudydesignplanarlinkages
AT tommasocinti geometricconstraintprogramminggcpimplementedthroughgeogebratostudydesignplanarlinkages