Volume 1B: 35th Computers and Information in Engineering Conference 2015
DOI: 10.1115/detc2015-47923
|View full text |Cite
|
Sign up to set email alerts
|

Haptic Assembly Using Skeletal Densities and Fourier Transforms

Abstract: Haptic-assisted virtual assembly and prototyping has seen significant attention over the past two decades. However, in spite of the appealing prospects, its adoption has been slower than expected. We identify the main roadblocks as the inherent geometric complexities faced when assembling objects of arbitrary shape, and the computation time limitation imposed by the notorious 1 kHz haptic refresh rate. We addressed the first problem in a recent work by introducing a generic energy model for geometric guidance … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(16 citation statements)
references
References 60 publications
0
16
0
Order By: Relevance
“…Recently, a novel method for solving virtual assembly problems in general (and for haptic rendering, in particular) was proposed by Behandish and Ilies (2015, 2016). The developed concept – “geometric energy field” – is very interesting and could represent a new type of solution to a complex problem.…”
Section: Real-time A/d Simulationsmentioning
confidence: 99%
“…Recently, a novel method for solving virtual assembly problems in general (and for haptic rendering, in particular) was proposed by Behandish and Ilies (2015, 2016). The developed concept – “geometric energy field” – is very interesting and could represent a new type of solution to a complex problem.…”
Section: Real-time A/d Simulationsmentioning
confidence: 99%
“…As usual, we assume solids to be 'r-sets', defined by Requicha [31] as compact (i.e., bounded and closed) regular semianalytic subsets of the Euclidean 3−space S ⊂ P(R 3 ). 4 The regularity condition (i.e., S = rS) ensures continuous homogeneity, 5 while the semianalytic requirement guarantees finite describability of the set [31], as well as its medial axis (MA) and medial axis transform (MAT) [7]. The latter is defined as an embedding of the MA in the 4D space with the radius of the maximal ball conceptualized as a new coordinate, and contains enough information to reconstruct the solid S, hence can be used to develop a discretization/sampling scheme in Section 2.2.…”
Section: Analytic Solid Modelingmentioning
confidence: 99%
“…For example, Minkowski operations [35] that are central to mathematical morphology are formalized as convolutions of constituent functions and computed efficiently in the Fourier domain [24]. Minkowski operations have been used extensively to formulate important problems in robot path planning [22], mechanism workspace design [26], virtual reality (graphics/haptics) [5,4], protein docking [1], packaging and nesting [9], and more. Unfortunately, their combinatorial computation even for 3D polyhedral objects quickly becomes impractical with increasing number of polygons [24].…”
Section: Introductionmentioning
confidence: 99%
“…However, this approach goes against the philosophy of avoiding the multiphase approach and manual specifications, from which we set off to pursue this method. We recently presented an alternative implementation in [63,64] that uses GPU-accelerated fast Fourier transforms (FFT) to enable real-time computations, the discussion of which is beyond the scope of this paper.…”
Section: Cross-correlationmentioning
confidence: 99%
“…The score gradient in ( 9) and (10), needed for the guidance forces and torques in (12) and (13), can be discretized in a similar fashion. Alternatively, one could approximate the gradient using the finite 5 We report on a similar implementation on the Graphics Processing Unit (GPU) in [63]. difference method (FDM) by multiple computations of ( 15) after applying small translational and rotational variations, along each of the 3 coordinate axes one at a time, to the relative transformation T = T −1 1 T 2 ∈ SE(3).…”
Section: Cross-correlationmentioning
confidence: 99%