The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rephael Wenger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark Babikov, Diane L. Souvaine, Rephael Wenger
    Constructing piecewise linear homeomorphisms of polygons with holes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  2. William L. Steiger, Rephael Wenger
    Hyperplane depth and nested simplices. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
    Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:112-115 [Conf]
  4. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    A Helly-type theorem for hyperplane transversals to well-separated convex sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:57-63 [Conf]
  5. David Avis, Rephael Wenger
    Algorithms for Line Transversals in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:300-307 [Conf]
  6. Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger
    The Combinatorial Complexity of Hyperplane Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:83-91 [Conf]
  7. Tamal K. Dey, Rephael Wenger
    Reconstruction curves with sharp corners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:233-241 [Conf]
  8. Peter Egyed, Rephael Wenger
    Stabbing Pairwise Disjoint Translates in Linear Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:364-369 [Conf]
  9. Jacob E. Goodman, Richard Pollack, Rephael Wenger
    Bounding the Number of Geometric Permutations Induced by k-Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:192-197 [Conf]
  10. Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu
    There is a Universal Topological Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:171-176 [Conf]
  11. Richard Pollack, Rephael Wenger
    Necessary and Sufficient Conditions for Hyperplane Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:152-155 [Conf]
  12. János Pach, Rephael Wenger
    Embedding Planar Graphs at Fixed Vertex Locations. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:263-274 [Conf]
  13. Chi-Chung Lam, P. Sadayappan, Rephael Wenger
    Optimal Reordering and Mapping of a Class of Nested-Loops for Parallel Execution. [Citation Graph (0, 0)][DBLP]
    LCPC, 1996, pp:315-329 [Conf]
  14. Chi-Chung Lam, P. Sadayappan, Rephael Wenger
    Optimization of a Class of Multi-Dimensional Integrals on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  15. Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Rephael Wenger
    Anisotropic surface meshing. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:202-211 [Conf]
  16. Caixia Zhang, Daqing Xue, Roger Crawfis, Rephael Wenger
    Time-Varying Interval Volumes. [Citation Graph (0, 0)][DBLP]
    Volume Graphics, 2005, pp:99-107 [Conf]
  17. Praveen Bhaniramka, Rephael Wenger, Roger Crawfis
    Isosurfacing in higher dimensions. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2000, pp:267-273 [Conf]
  18. Tamal K. Dey, Joachim Giesen, Samrat Goswami, James Hudson, Rephael Wenger, Wulue Zhao
    Undersampling and Oversampling in Sample Based Shape Modeling. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2001, pp:- [Conf]
  19. Guangfeng Ji, Han-Wei Shen, Rephael Wenger
    Volume Tracking Using Higher Dimensional Isocontouring. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 2003, pp:209-216 [Conf]
  20. Praveen Bhaniramka, Caixia Zhang, Daqing Xue, Roger Crawfis, Rephael Wenger
    Volume Interval Segmentation and Rendering. [Citation Graph (0, 0)][DBLP]
    VolVis, 2004, pp:55-62 [Conf]
  21. Himanshu Gupta, Rephael Wenger
    Constructing Pairwise Disjoint Paths with Few Links. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:416-425 [Conf]
  22. Rephael Wenger
    Randomized Quickhull. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:3, pp:322-329 [Journal]
  23. Jacob E. Goodman, Richard Pollack, Rephael Wenger, Tudor Zamfirescu
    Every Arrangement Extends to a Spread. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:3, pp:301-306 [Journal]
  24. Richard Pollack, Rephael Wenger
    Necessary and sufficient conditions for hyperplane transversals. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:3, pp:307-311 [Journal]
  25. Tamal K. Dey, Rephael Wenger
    Reconstructing curves with sharp corners. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:19, n:2-3, pp:89-99 [Journal]
  26. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    On the Helly Number for Hyperplane Transversals to Unit Balls. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:2-3, pp:171-176 [Journal]
  27. Boris Aronov, Jacob E. Goodman, Richard Pollack, Rephael Wenger
    A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:507-517 [Journal]
  28. David Avis, Rephael Wenger
    Polyhedral Line transversals in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:257-265 [Journal]
  29. Jacob E. Goodman, Richard Pollack, Rephael Wenger
    On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:469-476 [Journal]
  30. Rephael Wenger
    Upper Bounds on Geometric Permutations for Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:27-33 [Journal]
  31. Rephael Wenger
    A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:383-388 [Journal]
  32. János Pach, Rephael Wenger
    Embedding Planar Graphs at Fixed Vertex Locations. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:4, pp:717-728 [Journal]
  33. Tamal K. Dey, Rephael Wenger
    Fast Reconstruction of Curves with Sharp Corners. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:5, pp:353-400 [Journal]
  34. David Avis, J. M. Robert, Rephael Wenger
    Lower Bounds for Line Stabbing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:2, pp:59-62 [Journal]
  35. Himanshu Gupta, Rephael Wenger
    Constructing Piecewise Linear Homeomorphisms of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:142-157 [Journal]
  36. Jacob E. Goodman, Richard Pollack, Rephael Wenger
    Bounding the Number of Geometric Permutations Induced byk-Transversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:75, n:2, pp:187-197 [Journal]
  37. Rephael Wenger
    Extremal graphs with no C4's, C6's, or C10's. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:113-116 [Journal]
  38. Chi-Chung Lam, P. Sadayappan, Rephael Wenger
    On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:2, pp:157-168 [Journal]
  39. Praveen Bhaniramka, Rephael Wenger, Roger Crawfis
    Isosurface Construction in Any Dimension Using Convex Hulls. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2004, v:10, n:2, pp:130-141 [Journal]
  40. Himanshu Gupta, Rephael Wenger
    Constructing pairwise disjoint paths with few links. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  41. A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes. [Citation Graph (, )][DBLP]


  42. A Delaunay Simplification Algorithm for Vector Fields. [Citation Graph (, )][DBLP]


  43. Quality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table. [Citation Graph (, )][DBLP]


  44. Isotopic Reconstruction of Surfaces with Boundaries. [Citation Graph (, )][DBLP]


  45. Ordered stabbing of pairwise disjoint convex sets in linear time. [Citation Graph (, )][DBLP]


  46. Stability of Critical Points with Interval Persistence. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.334secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002