Sciweavers

214 search results - page 21 / 43
» Computing the Closest Point to a Circle
Sort
View
COMPGEOM
2000
ACM
13 years 12 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
ICIP
2006
IEEE
14 years 9 months ago
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robe...
AUTOMATICA
2008
83views more  AUTOMATICA 2008»
13 years 7 months ago
Periodic smoothing splines
Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...
Hiroyuki Kano, Magnus Egerstedt, Hiroyuki Fujioka,...
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
Jiann-Der Lee, Shih-Sen Hsieh, Chung-Hsien Huang, ...
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
14 years 2 months ago
Shortest paths on 3-D simple Lie groups with nonholonomic constraint
— In this paper we study the Carnot-Caratheodory metrics on SU(2) S3 , SO(3) and SL(2) induced by their Cartan decomposition and by the Killing form. Besides computing explicitly...
Ugo V. Boscain, Francesco Rossi