6 citations · 10 across the 7 of their papers we have counts for
4 papers · 1 filter
Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
Chih-Hung Liu
We study the k nearest neighbors problem in the plane for general, convex, pairwise disjoint sites of constant description complexity such as line segments, disks, and quadrilatera…
Approximate Minimum Selection with Unreliable Comparisons in Optimal Expected Time
Stefano Leucci, Chih-Hung Liu
We consider the \emph{approximate minimum selection} problem in presence of \emph{independent random comparison faults}. This problem asks to select one of the smallest element…
Optimal Sorting with Persistent Comparison Errors
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu +1
We consider the problem of sorting elements in the case of \emph{persistent} comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison between two eleme…
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram in a Simple Polygon
Chih-Hung Liu
The geodesic Voronoi diagram of m point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells, one to each site, such that all points in a cell s…