L. Paul Chew

According to our database1, L. Paul Chew authored at least 33 papers between 1985 and 2009.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Optimistic parallelism requires abstractions.
Commun. ACM, 2009

FASH: A web application for nucleotides sequence search.
Source Code Biol. Medicine, 2008

Scheduling strategies for optimistic parallel execution of irregular programs.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Optimistic parallelism benefits from data partitioning.
Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, 2008

Indexing for Function Approximation.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

Exact computation of protein structure similarity.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations.
Inf. Process. Lett., 2004

Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains.
Comput. Geom., 2004

Finding the Consensus Shape for a Protein Family.
Algorithmica, 2004


Walking around fat obstacles.
Inf. Process. Lett., 2002

A Concise Representation of Geometry Suitable for Mesh Generation.
Proceedings of the 11th International Meshing Roundtable, 2002

Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives.
Proceedings of the Parallel and Distributed Processing, 2000

Fast Detection of Common Geometric Substructure in Proteins.
J. Comput. Biol., 1999

Geometric Pattern Matching in d -Dimensional Space.
Discret. Comput. Geom., 1999

Emerging Challenges in Computational Topology
CoRR, 1999

Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.
J. Algorithms, 1998

Getting around a lower bound for the minimum Hausdorff distance.
Comput. Geom., 1998

Geometric Pattern Matching Under Euclidean Motion.
Comput. Geom., 1997

Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points.
Comput. Geom., 1997

Sorting Helps for Voronoi Diagrams.
Algorithmica, 1997

Guaranteed-Quality Delaunay Meshing in 3D (Short Version).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
Proceedings of the Algorithms, 1996

Dihedral Bounds for Mesh Generation in High Dimensions.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion.
Comput. Geom., 1993

Guaranteed-Quality Mesh Generation for Curved Surfaces.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Improvements on Geometric Pattern Matching Problems.
Proceedings of the Algorithm Theory, 1992

An Efficiently Computable Metric for Comparing Polygonal Shapes.
IEEE Trans. Pattern Anal. Mach. Intell., 1991

Constrained Delaunay Triangulations.
Algorithmica, 1989

Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

Voronoi diagrams based on convex distance functions.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

Planning the shortest path for a disc in <i>O</i>(<i>n</i><sup>2</sup>log <i>n</i>) time.
Proceedings of the First Annual Symposium on Computational Geometry, 1985