Rephael Wenger

  • Ohio State University, Columbus, USA

According to our database1, Rephael Wenger authored at least 51 papers between 1987 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Interactive Exploration and Visualization Using MetaTracts extracted from Carbon Fiber Reinforced Composites.
IEEE Trans. Vis. Comput. Graph., 2017

Visualizing Flow Fields Using Fractal Dimensions.
Proceedings of the 18th Eurographics Conference on Visualization, 2016

MetaTracts - A method for robust extraction and visualization of carbon fiber bundles in fiber reinforced composites.
Proceedings of the 2015 IEEE Pacific Visualization Symposium, 2015

Exploring Flow Fields Using Space-Filling Analysis of Streamlines.
IEEE Trans. Vis. Comput. Graph., 2014

The JS-graphs of Join and Split Trees.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Constructing Isosurfaces with Sharp Edges and Corners using Cube Merging.
Comput. Graph. Forum, 2013

On the Fractal Dimension of Isosurfaces.
IEEE Trans. Vis. Comput. Graph., 2010

A randomized <i>O</i>(<i>m</i> log <i>m</i>) time algorithm for computing Reeb graphs of arbitrary simplicial complexes.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

Isotopic Reconstruction of Surfaces with Boundaries.
Comput. Graph. Forum, 2009

Quality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table.
Comput. Graph. Forum, 2008

Constructing pairwise disjoint paths with few links.
ACM Trans. Algorithms, 2007

Stability of Critical Points with Interval Persistence.
Discret. Comput. Geom., 2007

A Delaunay Simplification Algorithm for Vector Fields.
Proceedings of the 15th Pacific Conference on Computer Graphics and Applications, 2007

Contour Area Filtering of two-dimensional electrophoresis images.
Medical Image Anal., 2006

Anisotropic surface meshing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Time-Varying Interval Volumes.
Proceedings of the 4th Eurographics / IEEE VGTC International Workshop on Volume Graphics, 2005

Helly-Type Theorems and Geometric Transversals.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Isosurface Construction in Any Dimension Using Convex Hulls.
IEEE Trans. Vis. Comput. Graph., 2004

Volume Interval Segmentation and Rendering.
Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics, 2004

Volume Tracking Using Higher Dimensional Isocontouring.
Proceedings of the 14th IEEE Visualization Conference, 2003

Fast Reconstruction of Curves with Sharp Corners.
Int. J. Comput. Geom. Appl., 2002

Embedding Planar Graphs at Fixed Vertex Locations.
Graphs Comb., 2001

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets.
Discret. Comput. Geom., 2001

Reconstructing curves with sharp corners.
Comput. Geom., 2001

Undersampling and Oversampling in Sample Based Shape Modeling.
Proceedings of the 12th IEEE Visualization Conference, 2001

On the Helly Number for Hyperplane Transversals to Unit Balls.
Discret. Comput. Geom., 2000

Isosurfacing in higher dimensions.
Proceedings of the 11th IEEE Visualization Conference, 2000

Reconstruction curves with sharp corners.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Hyperplane depth and nested simplices.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution.
Parallel Process. Lett., 1997

Constructing Piecewise Linear Homeomorphisms of Simple Polygons.
J. Algorithms, 1997

Randomized Quickhull.
Algorithmica, 1997

Optimization of a Class of Multi-Dimensional Integrals on Parallel Machines.
Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Constructing piecewise linear homeomorphisms of polygons with holes.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

Bounding the Number of Geometric Permutations Induced byk-Transversals.
J. Comb. Theory, Ser. A, 1996

Optimal Reordering and Mapping of a Class of Nested-Loops for Parallel Execution.
Proceedings of the Languages and Compilers for Parallel Computing, 1996

On the Connected Components of the Space of Line Transersals t a Family of Convex Sets.
Discret. Comput. Geom., 1995

Every Arrangement Extends to a Spread.
Comb., 1994

Bounding the Number of Geometric Permutations Induced by <i>k</i>-Transversals.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

There is a Universal Topological Plane.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

Extremal graphs with no <i>C</i><sup>4</sup>'s, <i>C</i><sup>6</sup>'s, or <i>C</i><sup>10</sup>'s.
J. Comb. Theory, Ser. B, 1991

Points and Triangles in the Plane and Halving Planes in Space.
Discret. Comput. Geom., 1991

Ordered stabbing of pairwise disjoint convex sets in linear time.
Discret. Appl. Math., 1991

A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets.
Discret. Comput. Geom., 1990

Upper Bounds on Geometric Permutations for Convex Sets.
Discret. Comput. Geom., 1990

Necessary and sufficient conditions for hyperplane transversals.
Comb., 1990

The Combinatorial Complexity of Hyperplane Transversals.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Lower Bounds for Line Stabbing.
Inf. Process. Lett., 1989

Stabbing Pairwise Disjoint Translates in Linear Time.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

Polyhedral Line transversals in Space.
Discret. Comput. Geom., 1988

Algorithms for Line Transversals in Space.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987