Abstract
In recent years, there is an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of projective convexity as a key element for a new framework for kinematic geometry, that allows for the development of more elegant and efficient algorithms for geometric computations with kinematic applications. The resulting framework, called computational kinematic geometry, is developed by combining the oriented projective geometry with the kinematic geometry of rigid body motions.
| Original language | English |
|---|---|
| Pages | 715-723 |
| Number of pages | 9 |
| DOIs | |
| State | Published - 2002 |
| Event | 27th Biennial Mechanisms and Robotics Conference - Montreal, Que., Canada Duration: Sep 29 2002 → Oct 2 2002 |
Conference
| Conference | 27th Biennial Mechanisms and Robotics Conference |
|---|---|
| Country/Territory | Canada |
| City | Montreal, Que. |
| Period | 09/29/02 → 10/2/02 |
Fingerprint
Dive into the research topics of 'Projective convexity in computational kinematic geometry'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver