1.3k citations
- Universidad Autónoma de MadridES24 papers
- Université de Bretagne SudFR21 papers
- Max Planck Institute for Gravitational PhysicsDE19 papers
- University of Wisconsin–MilwaukeeUS15 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- Pennsylvania State UniversityUS14 papers
- Tsinghua UniversityCN14 papers
- The University of Texas at AustinUS13 papers
- University of MichiganUS13 papers
- California Institute of TechnologyUS12 papers
- Goddard Space Flight CenterUS12 papers
- Instituto de Física TeóricaES12 papers
4 papers · 2 filters
On the approximability of covering points by lines and related problems
Adrian Dumitrescu, Minghui Jiang
Given a set of points in the plane, {\sc Covering Points by Lines} is the problem of finding a minimum-cardinality set of lines such that every point is incid…
Computing the Geodesic Diameter and Center of a Simple Polygon in Linear Time
Sang Won Bae, Matias Korman, Yoshio Okamoto +1
In this paper, we show that the geodesic diameter and center of a simple polygon can be computed in linear time. For the purpose, we focus on revealing basic geometric proper…
Aggregate-Max Nearest Neighbor Searching in the Plane
Haitao Wang
We study the aggregate/group nearest neighbor searching for the MAX operator in the plane. For a set of points and a query set of points, the query asks for a point…
Efficient Algorithms for One-Dimensional k-Center Problems
Danny Z. Chen, Jian Li, Haitao Wang
We consider the problem of finding k centers for n weighted points on a real line. This (weighted) k-center problem was solved in O(n log n) time previously by using Cole's paramet…