The following pages link to L. Paul Chew (Q598236):
Displaying 19 items.
- Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains (Q598237) (← links)
- Near-quadratic bounds for the \(L_ 1\) Voronoi diagram of moving points (Q676585) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations (Q834956) (← links)
- Constrained Delaunay triangulations (Q1115601) (← links)
- (Q1355723) (redirect page) (← links)
- Sorting helps for Voronoi diagrams (Q1355725) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- There are planar graphs almost as good as the complete graph (Q1823959) (← links)
- Walking around fat obstacles. (Q1853053) (← links)
- (Q3138886) (← links)
- (Q3601574) (← links)
- Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions (Q4225864) (← links)
- Finding the consensus shape for a protein family (Q4557538) (← links)
- Guaranteed (Q4557548) (← links)
- Planar spanners and approximate shortest path queries among obstacles in the plane (Q4595512) (← links)
- (Q4886049) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
