L. Paul Chew

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Geometric pattern matching in d-dimensional space Lecture Notes in Computer Science	2023-05-08	Paper
Improvements on geometric pattern matching problems Algorithm Theory — SWAT '92	2022-12-09	Paper
Finding the consensus shape for a protein family Proceedings of the eighteenth annual symposium on Computational geometry	2018-11-23	Paper
Guaranteed: quality parallel Delaunay refinement for restricted polyhedral domains Proceedings of the eighteenth annual symposium on Computational geometry	2018-11-23	Paper
Planar spanners and approximate shortest path queries among obstacles in the plane Algorithms — ESA '96	2017-12-05	Paper
Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations Information Processing Letters	2009-08-27	Paper
scientific article; zbMATH DE number 5506239 (Why is no real title available?)	2009-02-10	Paper
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains Computational Geometry	2004-08-06	Paper
Walking around fat obstacles. Information Processing Letters	2003-01-21	Paper
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions Journal of Algorithms	1999-01-17	Paper
Getting around a lower bound for the minimum Hausdorff distance Computational Geometry	1998-11-26	Paper
Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points Computational Geometry	1997-03-18	Paper
Geometric pattern matching under Euclidean motion Computational Geometry	1997-03-18	Paper
Sorting helps for Voronoi diagrams Algorithmica	1997-01-01	Paper
scientific article; zbMATH DE number 910875 (Why is no real title available?)	1996-08-22	Paper
scientific article; zbMATH DE number 432758 (Why is no real title available?)	1994-09-20	Paper
A convex polygon among polygonal obstacle: Placement and high-clearance motion Computational Geometry	1994-01-19	Paper
Constrained Delaunay triangulations Algorithmica	1989-01-01	Paper
There are planar graphs almost as good as the complete graph Journal of Computer and System Sciences	1989-01-01	Paper

Research outcomes over time

This page was built for person: L. Paul Chew