Search For:

Displaying 1-12 out of 12 total
On the Fractal Dimension of Isosurfaces
Found in: IEEE Transactions on Visualization and Computer Graphics
By Marc Khoury, Rephael Wenger
Issue Date:November 2010
pp. 1198-1205
A (3D) scalar grid is a regular $n_1 x n_2 x n_3$ grid of vertices where each vertex v is associated with some scalar value $s_v$. ;Applying trilinear interpolation, the scalar grid determines a scalar function g where $g(v) = s_v$ for each grid vertex v. ...
 
A Delaunay Simplification Algorithm for Vector Fields
Found in: Computer Graphics and Applications, Pacific Conference on
By Tamal K. Dey, Joshua A. Levine, Rephael Wenger
Issue Date:November 2007
pp. 281-290
We present a Delaunay based algorithm for simplifying vector field datasets. Our aim is to reduce the size of the mesh on which the vector field is defined while preserving topological features of the original vector field. We leverage a simple paradigm, v...
 
Isosurface Construction in Any Dimension Using Convex Hulls
Found in: IEEE Transactions on Visualization and Computer Graphics
By Praveen Bhaniramka, Rephael Wenger, Roger Crawfis
Issue Date:March 2004
pp. 130-141
<p><b>Abstract</b>—We present an algorithm for constructing isosurfaces in any dimension. The input to the algorithm is a set of scalar values in a <it>d</it>-dimensional regular grid of (topological) hypercubes. The output is...
 
Undersampling and Oversampling in Sample Based Shape Modeling
Found in: Visualization Conference, IEEE
By Tamal K. Dey, Joachim Giesen, Samrat Goswami, James Hudson, Rephael Wenger, Wulue Zhao
Issue Date:October 2001
pp. N/A
Shape modeling is an integral part of many visualization problems. Recent advances in scanning technology and a number of surface reconstruction algorithms have opened up a new paradigm for modeling shapes from samples. Many of the problems currently faced...
 
Isosurfacing in Higher Dimensions
Found in: Visualization Conference, IEEE
By Praveen Bhaniramka, Rephael Wenger, Roger Crawfis
Issue Date:October 2000
pp. 46
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions higher than three. Most algorithms require a sampling in three-dimensions befor...
 
Exploring Flow Fields Using Space-filling Analysis of Streamlines
Found in: IEEE Transactions on Visualization and Computer Graphics
By Abon Chaudhuri,Teng-Yok Lee,Han-Wei Shen,Rephael Wenger
Issue Date:March 2014
pp. 1
Large scale scientific simulations frequently use streamline based techniques to visualize flow fields. As the shape of a streamline is often related to some underlying property of the field, it is important to identify streamlines (or their parts) with un...
 
Volume Interval Segmentation and Rendering
Found in: Volume Visualization and Graphics, IEEE Symposium on
By Praveen Bhaniramka, Caixia Zhang, Daqing Xue, Roger Crawfis, Rephael Wenger
Issue Date:October 2004
pp. 55-62
In this paper, we segment the volume into geometrically disjoint regions that can be rendered to provide a more effective and interactive volume rendering of structured and unstructured grids. Our segmentation is based upon intervals within the scalar fiel...
 
Anisotropic surface meshing
Found in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA '06)
By Edgar A. Ramos, Rephael Wenger, Siu-Wing Cheng, Tamal K. Dey
Issue Date:January 2006
pp. 202-211
We study the problem of triangulating a smooth closed implicit surface Σ endowed with a 2D metric tensor that varies over Σ. This is commonly known as the anisotropic surface meshing problem. We extend the 2D metric tensor naturally to 3D and emp...
     
Reconstruction curves with sharp corners
Found in: Proceedings of the sixteenth annual symposium on Computational geometry (SCG '00)
By Rephael Wenger, Tamal K. Dey
Issue Date:June 2000
pp. 233-241
An interactive visualization of weighted three-dimensional α-hulls is presented for static and dynamic spheres. The α-hull is analytically computed and represented by a triangulated mesh. The entire surface is computed and displayed in real-time ...
     
A Helly-type theorem for hyperplane transversals to well-separated convex sets
Found in: Proceedings of the sixteenth annual symposium on Computational geometry (SCG '00)
By Boris Aronov, Jacob E. Goodman, Rephael Wenger, Richard Pollack
Issue Date:June 2000
pp. 57-63
An interactive visualization of weighted three-dimensional α-hulls is presented for static and dynamic spheres. The α-hull is analytically computed and represented by a triangulated mesh. The entire surface is computed and displayed in real-time ...
     
Bounding the number of geometric permutations induced by k-transversals
Found in: Proceedings of the tenth annual symposium on Computational geometry (SCG '94)
By Jacob E. Goodman, Rephael Wenger, Richard Pollack
Issue Date:June 1994
pp. 192-197
We prove that a (k−1)-separated family of n compact convex sets in Rd can be met byk-transversals in at mostOdd22k+1-2knk+1kd-k or, for fixed k and d, O(nk(k+1)(d−k)) different order types. This is the first non-trivial bound for 1< k<d&m...
     
There is a universal topological plane
Found in: Proceedings of the eighth annual symposium on Computational geometry (SCG '92)
By Jacob E. Goodman, Rephael Wenger, Richard Pollack, Tudor Zamfirescu
Issue Date:June 1992
pp. 171-176
We show that the total number of faces bounding any single cell in an arrangement of n (d--1)-simplices in IRd is O(nd--1 log n), thus almost settling a conjecture of Pach and Sharir. We present several applications of this result, mainly to translational ...
     
 1