Results 1  10
of
1,680
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
family of volume rendering algorithms that reduces rendering times to one second. First we present a scanlineorder volume rendering algorithm that exploits coherence in both the volume data and the image. We show that scanlineorder algorithms are fundamentally more efficient than commonlyused ray
A Survey of Medical Image Registration
, 1998
"... The purpose of this chapter is to present a survey of recent publications concerning medical image registration techniques. These publications will be classified according to a model based on nine salient criteria, the main dichotomy of which is extrinsic versus intrinsic methods The statistics of t ..."
Abstract

Cited by 540 (5 self)
 Add to MetaCart
The purpose of this chapter is to present a survey of recent publications concerning medical image registration techniques. These publications will be classified according to a model based on nine salient criteria, the main dichotomy of which is extrinsic versus intrinsic methods The statistics
Precomputed Radiance Transfer for RealTime Rendering in Dynamic, LowFrequency Lighting Environments
 ACM Transactions on Graphics
, 2002
"... We present a new, realtime method for rendering diffuse and glossy objects in lowfrequency lighting environments that captures soft shadows, interreflections, and caustics. As a preprocess, a novel global transport simulator creates functions over the object's surface representing transfer of ..."
Abstract

Cited by 472 (28 self)
 Add to MetaCart
to the object every frame; the object can also be rigidly rotated with respect to the lighting and vice versa. Lighting and transfer functions are represented using loworder spherical harmonics. This avoids aliasing and evaluates efficiently on graphics hardware by reducing the shading integral to a dot
The Power Crust
, 2001
"... The power crust is a construction which takes a sample of points from the surface of a threedimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce ..."
Abstract

Cited by 266 (7 self)
 Add to MetaCart
The power crust is a construction which takes a sample of points from the surface of a threedimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce
Robust Construction of the Voronoi Diagram of a Polyhedron
 In Proc. 5th Canad. Conf. Comput. Geom
, 1993
"... This paper describes a practical algorithm for the construction of the Voronoi diagram of a three dimensional polyhedron using approximate arithmetic. This algorithm is intended to be implemented in floating point arithmetic. The full twodimensional version and significant portions of the threedim ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
This paper describes a practical algorithm for the construction of the Voronoi diagram of a three dimensional polyhedron using approximate arithmetic. This algorithm is intended to be implemented in floating point arithmetic. The full twodimensional version and significant portions of the threedimensional
ThreeDimensional Modeling of Human Organs and Its Application to Diagnosis and Surgical Planning
, 1993
"... We describe a method to obtain a 3D representation of objects given by a series of parallel crosssections. We define a contourtocontour connection based on geometric closeness and show a practical way to calculate an approximation using the Delaunay triangulation. The performance of our method is ..."
Abstract

Cited by 89 (3 self)
 Add to MetaCart
We describe a method to obtain a 3D representation of objects given by a series of parallel crosssections. We define a contourtocontour connection based on geometric closeness and show a practical way to calculate an approximation using the Delaunay triangulation. The performance of our method
Algorithms for ThreeDimensional FreeForm Object Matching
, 2003
"... Algorithms for ThreeDimensional ..."
Accurate Computation of the Medial Axis of a Polyhedron
 Polyhedron”, “Fifth ACM Symposium on Solid Modeling
, 1998
"... We present an accurate and efficient algorithm to compute the internal Voronoi region and medial axis of a 3D polyhedron. It uses exact arithmetic and representations for accurate computation of the medial axis. The sheets, seams, and junctions of the medial axis are represented as trimmed quadric ..."
Abstract

Cited by 45 (7 self)
 Add to MetaCart
We present an accurate and efficient algorithm to compute the internal Voronoi region and medial axis of a 3D polyhedron. It uses exact arithmetic and representations for accurate computation of the medial axis. The sheets, seams, and junctions of the medial axis are represented as trimmed quadric
Results 1  10
of
1,680