Clustering in polygonal domains

DOI10.4230/LIPICS.ISAAC.2023.23MaRDI QIDQ6953197zbMATH OpenFDO

Authors Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous

Publication date 24 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2023.23

zbMATH Keywords

clusteringcoresetgeodesic distanceoutliers

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A linear-time algorithm for the geodesic center of a simple polygon
• Approximate clustering via core-sets
• Computing a geodesic two-center of points in a simple polygon
• Finding small simple cycle separators for 2-connected planar graphs
• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• On the Complexity of Some Common Geometric Location Problems
• On the planar two-center problem and circular hulls
• Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams
• Optimal shortest path queries in a simple polygon
• Reduced constants for simple cycle graph separation
• The p-Centre Problem-Heuristic and Optimal Algorithms
• The searching over separators strategy to solve some NP-hard problems in subexponential time
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• TSP in a simple polygon

This page was built for publication: Clustering in polygonal domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953197)