Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, December 17, 2019, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Chih-Hung Liu
We study the k nearest neighbors problem in the plane for general, convex, pairwise disjoint objects of constant description complexity such as line segments, disks, and quadrilaterals and with respect to a general family of distance functions including the L_p-norms and additively weighted Euclidean distances. For point objects in the Euclidean metric, after four decades of effort, an optimal data structure has recently been developed with O(n) space, O(log n+k) query time, and O(n log n) preprocessing time. We compose nearly optimal data structures for the k nearest neighbors problem under general distance functions, for which we devise shallow cuttings of linear size. Shallow cuttings are a key technique for point objects in the Euclidean metric. Although shallow cuttings have been generalized to general distance functions, existing ones either could not be applied to the k nearest neighbors problem or have an extra polylog-factor in size. Our innovation is a new random sampling technique for the analysis of geometric structures.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login