Results 1  10
of
1,309
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 542 (2 self)
 Add to MetaCart
casting algorithms because the latter must perform analytic geometry calculations (e.g. intersecting rays with axisaligned boxes). The new scanlineorder algorithm simply streams through the volume and the image in storage order. We describe variants of the algorithm for both parallel and perspective
Polynomial time algorithms for maximizing the intersection volume of polytopes
 Pacific Journal of Optimization
"... Abstract: Suppose that we have several polytopes in Rd and we can translate them without rotation. Here we consider the intersection maximization problem, which asks the positions of the polytopes which maximizes the volume of their intersection. In this paper, we address this problem, and show that ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract: Suppose that we have several polytopes in Rd and we can translate them without rotation. Here we consider the intersection maximization problem, which asks the positions of the polytopes which maximizes the volume of their intersection. In this paper, we address this problem, and show
From Data Mining to Knowledge Discovery in Databases.
 AI Magazine,
, 1996
"... ■ Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. What is all the excitement about? This article provides an overview of this emerging field, clarifying how data mining and knowledge discovery in database ..."
Abstract

Cited by 538 (0 self)
 Add to MetaCart
research directions in the field. A cross a wide variety of fields, data are being collected and accumulated at a dramatic pace. There is an urgent need for a new generation of computational theories and tools to assist humans in extracting useful information (knowledge) from the rapidly growing volumes
The SRtree: An Index Structure for HighDimensional Nearest Neighbor Queries
, 1997
"... Recently, similarity queries on feature vectors have been widely used to perform contentbased retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor queries e ciently. The SStree had been proposed for ..."
Abstract

Cited by 438 (3 self)
 Add to MetaCart
volume than bounding rectangles with highdimensional data and that this reduces search efficiency. To overcome this drawback, we propose a new index structure called the SRtree (Sphere/Rectangletree) which integrates bounding spheres and bounding rectangles. A region of the SRtree is specified
Efficient collision detection using bounding volume hierarchies of kdops
 IEEE Transactions on Visualization and Computer Graphics
, 1998
"... Abstract—Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment ..."
Abstract

Cited by 290 (4 self)
 Add to MetaCart
and of the environment. Our algorithms have been implemented and tested. We provide experimental evidence showing that our approach yields substantially faster collision detection than previous methods. Index Terms—Collision detection, intersection searching, bounding volume hierarchies, discrete orientation polytopes
A survey of content based 3D shape retrieval methods
 Multimedia Tools and Applications
, 2008
"... Recent developments in techniques for modeling, digitizing and visualizing 3D shapes has led to an explosion in the number of available 3D models on the Internet and in domainspecific databases. This has led to the development of 3D shape retrieval systems that, given a query object, retrieve simil ..."
Abstract

Cited by 289 (1 self)
 Add to MetaCart
similar 3D objects. For visualization, 3D shapes are often represented as a surface, in particular polygonal meshes, for example in VRML format. Often these models contain holes, intersecting polygons, are not manifold, and do not enclose a volume unambiguously. On the contrary, 3D volume models
THE COLORED JONES POLYNOMIALS AND THE SIMPLICIAL VOLUME OF A Knot
, 1999
"... We show that the set of colored Jones polynomials and the set of generalized Alexander polynomials defined by Akutsu, Deguchi and Ohtsuki intersect nontrivially. Moreover it is shown that the intersection is (at least includes) the set of Kashaev’s quantum dilogarithm invariants for links. Theref ..."
Abstract

Cited by 163 (15 self)
 Add to MetaCart
We show that the set of colored Jones polynomials and the set of generalized Alexander polynomials defined by Akutsu, Deguchi and Ohtsuki intersect nontrivially. Moreover it is shown that the intersection is (at least includes) the set of Kashaev’s quantum dilogarithm invariants for links
Intersecting Families with Minimum Volume
, 2001
"... We determine the minimum volume (sum of cardinalities) of an intersecting family of subsets of an nset, given the size of the family, by solving a simple linear program. From this we obtain a lower bound on the average size of the sets in an intersecting family. This answers a question of G. O. H. ..."
Abstract
 Add to MetaCart
We determine the minimum volume (sum of cardinalities) of an intersecting family of subsets of an nset, given the size of the family, by solving a simple linear program. From this we obtain a lower bound on the average size of the sets in an intersecting family. This answers a question of G. O. H
A Fast Voxel Traversal Algorithm for Ray Tracing
 In Eurographics ’87
, 1987
"... A fast and simple voxel traversal algorithm through a 3D space partition is introduced. Going from one voxel to its neighbour requires only two floating point comparisons and one floating point addition. Also, multiple ray intersections with objects that are in more than one voxel are eliminated. ..."
Abstract

Cited by 207 (5 self)
 Add to MetaCart
for intersection culling: hierarchical bounding volumes 1, 2, 3, 4 and space partitioning...
INTERSECTIONS USING A
"... to provide the practitioner with a guide for selecting intersection trfilc control based on peak hour intersection volumes. With the release of the 1994 Highway Capaci ~ Manual (HCM)l and the revisions to Chapter 10 on unsignalized intersections, the ability to directly compare intersection operatio ..."
Abstract
 Add to MetaCart
to provide the practitioner with a guide for selecting intersection trfilc control based on peak hour intersection volumes. With the release of the 1994 Highway Capaci ~ Manual (HCM)l and the revisions to Chapter 10 on unsignalized intersections, the ability to directly compare intersection
Results 1  10
of
1,309