- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j25 |      | Marc Khoury, Rephael Wenger: On the Fractal Dimension of Isosurfaces. IEEE Trans. Vis. Comput. Graph. 16(6): 1198-1205 (2010) |
| c23 | | William Harvey, Yusu Wang, Rephael Wenger: A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes. Symposium on Computational Geometry 2010: 267-276 |
| 2009 | ||
| j24 | | Tamal K. Dey, Kuiyu Li, Edgar A. Ramos, Rephael Wenger: Isotopic Reconstruction of Surfaces with Boundaries. Comput. Graph. Forum 28(5): 1371-1382 (2009) |
| 2008 | ||
| j23 | | Sundaresan Raman, Rephael Wenger: Quality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table. Comput. Graph. Forum 27(3): 791-798 (2008) |
| 2007 | ||
| j22 | | Tamal K. Dey, Rephael Wenger: Stability of Critical Points with Interval Persistence. Discrete & Computational Geometry 38(3): 479-512 (2007) |
| j21 | | Himanshu Gupta, Rephael Wenger: Constructing pairwise disjoint paths with few links. ACM Transactions on Algorithms 3(3) (2007) |
| c22 | | Tamal K. Dey, Joshua A. Levine, Rephael Wenger: A Delaunay Simplification Algorithm for Vector Fields. Pacific Conference on Computer Graphics and Applications 2007: 281-290 |
| 2006 | ||
| j20 | | Ramakrishnan Kazhiyur-Mannar, Dominic J. Smiraglia, Christoph Plass, Rephael Wenger: Contour Area Filtering of two-dimensional electrophoresis images. Medical Image Analysis 10(3): 353-365 (2006) |
| c21 | | Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Rephael Wenger: Anisotropic surface meshing. SODA 2006: 202-211 |
| 2005 | ||
| c20 | | Caixia Zhang, Daqing Xue, Roger Crawfis, Rephael Wenger: Time-Varying Interval Volumes. Volume Graphics 2005: 99-107 |
| 2004 | ||
| j19 | | Praveen Bhaniramka, Rephael Wenger, Roger Crawfis: Isosurface Construction in Any Dimension Using Convex Hulls. IEEE Trans. Vis. Comput. Graph. 10(2): 130-141 (2004) |
| c19 | | Praveen Bhaniramka, Caixia Zhang, Daqing Xue, Roger Crawfis, Rephael Wenger: Volume Interval Segmentation and Rendering. VolVis 2004: 55-62 |
| 2003 | ||
| c18 | | Guangfeng Ji, Han-Wei Shen, Rephael Wenger: Volume Tracking Using Higher Dimensional Isocontouring. IEEE Visualization 2003: 209-216 |
| 2002 | ||
| j18 | | Tamal K. Dey, Rephael Wenger: Fast Reconstruction of Curves with Sharp Corners. Int. J. Comput. Geometry Appl. 12(5): 353-400 (2002) |
| 2001 | ||
| j17 | | Tamal K. Dey, Rephael Wenger: Reconstructing curves with sharp corners. Comput. Geom. 19(2-3): 89-99 (2001) |
| j16 | | Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger: A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. Discrete & Computational Geometry 25(4): 507-517 (2001) |
| j15 | | János Pach, Rephael Wenger: Embedding Planar Graphs at Fixed Vertex Locations. Graphs and Combinatorics 17(4): 717-728 (2001) |
| c17 | | Tamal K. Dey, Joachim Giesen, Samrat Goswami, James Hudson, Rephael Wenger, Wulue Zhao: Undersampling and Oversampling in Sample Based Shape Modeling. IEEE Visualization 2001 |
| 2000 | ||
| j14 | | Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger: On the Helly Number for Hyperplane Transversals to Unit Balls. Discrete & Computational Geometry 24(2-3): 171-176 (2000) |
| c16 | | Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger: A Helly-type theorem for hyperplane transversals to well-separated convex sets. Symposium on Computational Geometry 2000: 57-63 |
| c15 | | Tamal K. Dey, Rephael Wenger: Reconstruction curves with sharp corners. Symposium on Computational Geometry 2000: 233-241 |
| c14 | | Praveen Bhaniramka, Rephael Wenger, Roger Crawfis: Isosurfacing in higher dimensions. IEEE Visualization 2000: 267-273 |
| 1998 | ||
| c13 | | |
| c12 | | János Pach, Rephael Wenger: Embedding Planar Graphs at Fixed Vertex Locations. Graph Drawing 1998: 263-274 |
| 1997 | ||
| j13 | | |
| j12 | | Himanshu Gupta, Rephael Wenger: Constructing Piecewise Linear Homeomorphisms of Simple Polygons. J. Algorithms 22(1): 142-157 (1997) |
| j11 | | Chi-Chung Lam, P. Sadayappan, Rephael Wenger: On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution. Parallel Processing Letters 7(2): 157-168 (1997) |
| c11 |  | Mark Babikov, Diane L. Souvaine, Rephael Wenger: Constructing piecewise linear homeomorphisms of polygons with holes. CCCG 1997 |
| c10 | | Chi-Chung Lam, P. Sadayappan, Rephael Wenger: Optimization of a Class of Multi-Dimensional Integrals on Parallel Machines. PPSC 1997 |
| c9 | | Himanshu Gupta, Rephael Wenger: Constructing Pairwise Disjoint Paths with Few Links. WADS 1997: 416-425 |
| 1996 | ||
| j10 | | Jacob E. Goodman, Richard Pollack, Rephael Wenger: Bounding the Number of Geometric Permutations Induced byk-Transversals. J. Comb. Theory, Ser. A 75(2): 187-197 (1996) |
| c8 | | Chi-Chung Lam, P. Sadayappan, Rephael Wenger: Optimal Reordering and Mapping of a Class of Nested-Loops for Parallel Execution. LCPC 1996: 315-329 |
| 1995 | ||
| j9 | | Jacob E. Goodman, Richard Pollack, Rephael Wenger: On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. Discrete & Computational Geometry 13: 469-476 (1995) |
| 1994 | ||
| j8 | | Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu: Every Arrangement Extends to a Spread. Combinatorica 14(3): 301-306 (1994) |
| c7 | | Jacob E. Goodman, Richard Pollack, Rephael Wenger: Bounding the Number of Geometric Permutations Induced by k-Transversals. Symposium on Computational Geometry 1994: 192-197 |
| 1992 | ||
| c6 | | Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu: There is a Universal Topological Plane. Symposium on Computational Geometry 1992: 171-176 |
| 1991 | ||
| j7 | | Peter Egyed, Rephael Wenger: Ordered stabbing of pairwise disjoint convex sets in linear time. Discrete Applied Mathematics 31(2): 133-140 (1991) |
| j6 | | Rephael Wenger: Extremal graphs with no C4's, C6's, or C10's. J. Comb. Theory, Ser. B 52(1): 113-116 (1991) |
| 1990 | ||
| j5 | | Richard Pollack, Rephael Wenger: Necessary and sufficient conditions for hyperplane transversals. Combinatorica 10(3): 307-311 (1990) |
| j4 | | Rephael Wenger: Upper Bounds on Geometric Permutations for Convex Sets. Discrete & Computational Geometry 5: 27-33 (1990) |
| j3 | | Rephael Wenger: A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets. Discrete & Computational Geometry 5: 383-388 (1990) |
| c5 | | Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger: The Combinatorial Complexity of Hyperplane Transversals. Symposium on Computational Geometry 1990: 83-91 |
| c4 | | Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger: Points and Triangles in the Plane and Halving Planes in Space. Symposium on Computational Geometry 1990: 112-115 |
| 1989 | ||
| j2 | | David Avis, J. M. Robert, Rephael Wenger: Lower Bounds for Line Stabbing. Inf. Process. Lett. 33(2): 59-62 (1989) |
| c3 | | Richard Pollack, Rephael Wenger: Necessary and Sufficient Conditions for Hyperplane Transversals. Symposium on Computational Geometry 1989: 152-155 |
| c2 | | Peter Egyed, Rephael Wenger: Stabbing Pairwise Disjoint Translates in Linear Time. Symposium on Computational Geometry 1989: 364-369 |
| 1988 | ||
| j1 | | David Avis, Rephael Wenger: Polyhedral Line transversals in Space. Discrete & Computational Geometry 3: 257-265 (1988) |
| 1987 | ||
| c1 | | David Avis, Rephael Wenger: Algorithms for Line Transversals in Space. Symposium on Computational Geometry 1987: 300-307 |
Colors in the list of coauthors
Last update Fri May 24 04:20:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page