173 citations
- University of Illinois Urbana-ChampaignUS13 papers
- Texas A&M UniversityUS10 papers
- Fermi National Accelerator LaboratoryUS9 papers
- Michigan State UniversityUS9 papers
- University of FloridaUS9 papers
- University of PennsylvaniaUS9 papers
- University of RochesterUS9 papers
- Argonne National LaboratoryUS8 papers
- Baylor UniversityUS8 papers
- Brandeis UniversityUS8 papers
- Carnegie Mellon UniversityUS8 papers
- Centre National de la Recherche ScientifiqueFR8 papers
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2009★ 10 cited
On the Set Multi-Cover Problem in Geometric Settings
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subse…
cs.CG2005★ 1 cited
A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions
Sariel Har-Peled, Alper Ungor
We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes time, where is the…