Morse Theory for the k-NN Distance Function

Yohai Reani, Omer Bobrowski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study the k-th nearest neighbor distance function from a finite point-set in Rd. We provide a Morse theoretic framework to analyze the sub-level set topology. In particular, we present a simple combinatorial-geometric characterization for critical points and their indices, along with detailed information about the possible changes in homology at the critical levels. We conclude by computing the expected number of critical points for a homogeneous Poisson process. Our results deliver significant insights and tools for the analysis of persistent homology in order-k Delaunay mosaics, and random k-fold coverage.

Original languageEnglish
Title of host publication40th International Symposium on Computational Geometry, SoCG 2024
EditorsWolfgang Mulzer, Jeff M. Phillips
ISBN (Electronic)9783959773164
DOIs
StatePublished - Jun 2024
Event40th International Symposium on Computational Geometry, SoCG 2024 - Athens, Greece
Duration: 11 Jun 202414 Jun 2024

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume293

Conference

Conference40th International Symposium on Computational Geometry, SoCG 2024
Country/TerritoryGreece
CityAthens
Period11/06/2414/06/24

Keywords

  • Applied topology
  • Distance function
  • Morse theory
  • k-nearest neighbor

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Morse Theory for the k-NN Distance Function'. Together they form a unique fingerprint.

Cite this