Skip to main navigation Skip to search Skip to main content

Projective convexity in computational kinematic geometry

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages715-723
Number of pages9
DOIs
StatePublished - 2002
Event27th Biennial Mechanisms and Robotics Conference - Montreal, Que., Canada
Duration: Sep 29 2002Oct 2 2002

Conference

Conference27th Biennial Mechanisms and Robotics Conference
Country/TerritoryCanada
CityMontreal, Que.
Period09/29/0210/2/02

Fingerprint

Dive into the research topics of 'Projective convexity in computational kinematic geometry'. Together they form a unique fingerprint.

Cite this