scispace - formally typeset
Search or ask a question
Author

Kenneth I. Joy

Bio: Kenneth I. Joy is an academic researcher from University of California, Davis. The author has contributed to research in topics: Visualization & Data visualization. The author has an hindex of 38, co-authored 228 publications receiving 5241 citations. Previous affiliations of Kenneth I. Joy include University of California & Carl Albert State College.


Papers
More filters
Proceedings ArticleDOI
01 Aug 1996
TL;DR: A new free-form deformation technique is presented that generalizes previous methods by allowing 3-dimensional deformation lattices of arbitrary topology to be defined, and thus a broader range of shape deformations can be generated.
Abstract: A new free-form deformation technique is presented that generalizes previous methods by allowing 3-dimensional deformation lattices of arbitrary topology. The technique uses an extension of the Catmull-Clark subdivision methodology that successively refines a 3-dimensional lattice into a sequence of lattices that converge uniformly to a region of 3-dimensional space. Deformation of the lattice then implicitly defines a deformation of the space. An underlying model can be deformed by establishing positions of the points of the model within the converging sequence of lattices and then tracking the new positions of these points within the deformed sequence of lattices. This technique allows a greater variety of deformable regions to be defined, and thus a broader range of shape deformations can be generated.

419 citations

Proceedings ArticleDOI
24 Oct 1999
TL;DR: This paper presents a multiresolution technique for interactive texture-based volume visualization of very large data sets that uses an adaptive scheme that renders the volume in a region-of-interest at a high resolution and the volume away from this region at progressively lower resolutions.
Abstract: We present a multiresolution technique for interactive texture-based volume visualization of very large data sets. This method uses an adaptive scheme that renders the volume in a region-of-interest at a high resolution and the volume away from this region at progressively lower resolutions. The algorithm is based on the segmentation of texture space into an octree, where the leaves of the tree define the original data and the internal nodes define lower-resolution versions. Rendering is done adaptively by selecting high-resolution cells close to a center of attention and low-resolution cells away from this area. We limit the artifacts introduced by this method by modifying the transfer functions in the lower-resolution data sets and utilizing spherical shells as a proxy geometry. It is possible to use this technique to produce viewpoint-dependent renderings of very large data sets.

275 citations

Journal ArticleDOI
TL;DR: To test the feasibility of using sound to represent graphs, a prototype system was developed and human factors experimenters were performed and it was discovered that mathematical concepts such as symmetry, monotonicity, and the slopes of lines could be determined quickly using sound.
Abstract: A system for the creation of computer-generated sound patterns of two-dimensional line graphs is described. The objectives of the system are to provide the blind with a means of understanding line graphs in the holistic manner used by those with sight. A continuously varying pitch is used to represent motion in the x direction. To test the feasibility of using sound to represent graphs, a prototype system was developed and human factors experimenters were performed. Fourteen subjects were used to compare the tactile-graph methods normally used by the blind to these new sound graphs. It was discovered that mathematical concepts such as symmetry, monotonicity, and the slopes of lines could be determined quickly using sound. Even better performance may be expected with additional training. The flexibility, speed, cost-effectiveness, and greater measure of independence provided the blind or sight-impaired using these methods was demonstrated.

145 citations

Proceedings ArticleDOI
24 Oct 1999
TL;DR: This work presents a method for the hierarchical representation of vector fields based on iterative refinement using clustering and principal component analysis, and assumes no particular structure of the field, nor does it require any topological connectivity information.
Abstract: We present a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The input to our algorithm is a discrete set of points with associated vectors. The algorithm generates a top-down segmentation of the discrete field by splitting clusters of points. We measure the error of the various approximation levels by measuring the discrepancy between streamlines generated by the original discrete field and its approximations based on much smaller discrete data sets. Our method assumes no particular structure of the field, nor does it require any topological connectivity information. It is possible to generate multiresolution representations of vector fields using this approach.

117 citations


Cited by
More filters
01 Jan 2005
TL;DR: The Monthly Notices as mentioned in this paper is one of the three largest general primary astronomical research publications in the world, published by the Royal Astronomical Society (RAE), and it is the most widely cited journal in astronomy.
Abstract: Monthly Notices is one of the three largest general primary astronomical research publications. It is an international journal, published by the Royal Astronomical Society. This article 1 describes its publication policy and practice.

2,091 citations

01 Mar 1987
TL;DR: The variable-order Adams method (SIVA/DIVA) package as discussed by the authors is a collection of subroutines for solution of non-stiff ODEs.
Abstract: Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

1,955 citations

Book
02 Jan 1991

1,377 citations

Proceedings ArticleDOI
01 Jul 1999
TL;DR: This work presents a sketching interface for quickly and easily designing freeform models such as stuffed animals and other rotund objects and shows that a first-time user typically masters the operations within 10 minutes, and can construct interesting 3D models within minutes.
Abstract: We present a sketching interface for quickly and easily designing freeform models such as stuffed animals and other rotund objects. The user draws several 2D freeform strokes interactively on the screen and the system automatically constructs plausible 3D polygonal surfaces. Our system supports several modeling operations, including the operation to construct a 3D polygonal surface from a 2D silhouette drawn by the user: it inflates the region surrounded by the silhouette making wide areas fat, and narrow areas thin. Teddy, our prototype system, is implemented as a Java™ program, and the mesh construction is done in real-time on a standard PC. Our informal user study showed that a first-time user typically masters the operations within 10 minutes, and can construct interesting 3D models within minutes.

1,181 citations