The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

L. Paul Chew: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
    An Efficiently Computable Metric for Comparing Polygonal Shapes. [Citation Graph (1, 0)][DBLP]
    SODA, 1990, pp:129-137 [Conf]
  2. L. Paul Chew
    Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:364-369 [Conf]
  3. L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
    Geometric Pattern Matching Under Euclidean Motion. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:151-156 [Conf]
  4. L. Paul Chew
    Exact computation of protein structure similarity. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:468-474 [Conf]
  5. L. Paul Chew
    Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:215-222 [Conf]
  6. L. Paul Chew
    Guaranteed-Quality Mesh Generation for Curved Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:274-280 [Conf]
  7. L. Paul Chew
    Guaranteed-Quality Delaunay Meshing in 3D (Short Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:391-393 [Conf]
  8. L. Paul Chew, Klara Kedem
    Finding the consensus shape for a protein family. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:64-73 [Conf]
  9. L. Paul Chew, Klara Kedem
    Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:167-173 [Conf]
  10. Démian Nave, Nikos Chrisochoides, L. Paul Chew
    Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:135-144 [Conf]
  11. Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis
    Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:514-528 [Conf]
  12. L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
    Geometric Pattern Matching in d-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:264-279 [Conf]
  13. L. Paul Chew, Nikos Chrisochoides, S. Gopalsamy, Gerd Heber, Anthony R. Ingraffea, Edward Luke, Joaquim B. Cavalcante Neto, Keshav Pingali, Alan M. Shih, Bharat K. Soni, Paul Stodghill, David Thompson, Stephen A. Vavasis, Paul A. Wawrzynek
    Computational Science Simulations Based on Web Services. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science, 2003, pp:299-308 [Conf]
  14. L. Paul Chew, Stephen A. Vavasis, S. Gopalsamy, TzuYi Yu, Bharat K. Soni
    A Concise Representation of Geometry Suitable for Mesh Generation. [Citation Graph (0, 0)][DBLP]
    IMR, 2002, pp:275-283 [Conf]
  15. Bruce Carter, Chuin-Shan Chen, L. Paul Chew, Nikos Chrisochoides, Guang R. Gao, Gerd Heber, Anthony R. Ingraffea, Roland Krause, Chris Myers, Démian Nave, Keshav Pingali, Paul Stodghill, Stephen A. Vavasis, Paul A. Wawrzynek
    Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:443-449 [Conf]
  16. L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg
    Fast detection of common geometric substructure in proteins. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:104-114 [Conf]
  17. Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert
    Dihedral Bounds for Mesh Generation in High Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:189-196 [Conf]
  18. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
    Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:197-204 [Conf]
  19. L. Paul Chew, Klara Kedem
    Improvements on Geometric Pattern Matching Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:318-325 [Conf]
  20. Biswanath Panda, Mirek Riedewald, Stephen B. Pope, Johannes Gehrke, L. Paul Chew
    Indexing for Function Approximation. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:523-534 [Conf]
  21. L. Paul Chew
    Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:1, pp:97-108 [Journal]
  22. L. Paul Chew, Steven Fortune
    Sorting Helps for Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:2, pp:217-228 [Journal]
  23. L. Paul Chew, Klara Kedem
    Finding the Consensus Shape for a Protein Family. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:1, pp:115-129 [Journal]
  24. L. Paul Chew
    Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:73-80 [Journal]
  25. L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
    Geometric Pattern Matching Under Euclidean Motion. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:113-124 [Journal]
  26. L. Paul Chew, Klara Kedem
    A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:59-89 [Journal]
  27. L. Paul Chew, Klara Kedem
    Getting around a lower bound for the minimum Hausdorff distance. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:197-202 [Journal]
  28. Démian Nave, Nikos Chrisochoides, L. Paul Chew
    Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:191-215 [Journal]
  29. Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin
    Emerging Challenges in Computational Topology [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  30. L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
    Geometric Pattern Matching in d -Dimensional Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:2, pp:257-274 [Journal]
  31. L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem
    Walking around fat obstacles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:135-140 [Journal]
  32. Amit Weisman, L. Paul Chew, Klara Kedem
    Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:5, pp:245-251 [Journal]
  33. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
    Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:238-255 [Journal]
  34. L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg
    Fast Detection of Common Geometric Substructure in Proteins. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:3/4, pp:- [Journal]
  35. Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
    An Efficiently Computable Metric for Comparing Polygonal Shapes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1991, v:13, n:3, pp:209-216 [Journal]
  36. Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
    Optimistic parallelism requires abstractions. [Citation Graph (0, 0)][DBLP]
    PLDI, 2007, pp:211-222 [Conf]

  37. Optimistic parallelism benefits from data partitioning. [Citation Graph (, )][DBLP]


  38. Voronoi diagrams based on convex distance functions. [Citation Graph (, )][DBLP]


  39. Planning the shortest path for a disc in O(n2log n) time. [Citation Graph (, )][DBLP]


  40. Scheduling strategies for optimistic parallel execution of irregular programs. [Citation Graph (, )][DBLP]


  41. Optimistic parallelism requires abstractions. [Citation Graph (, )][DBLP]


Search in 0.139secs, Finished in 0.141secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002