Geodesic disks and clustering in a simple polygon

DOI10.1142/S0218195911003822zbMATH Open1251.68281OpenAlexW2073543798MaRDI QIDQ4650081FDOQ4650081

Authors: Magdalene G. Borgelt, Jun Luo, Marc Van Kreveld 

Publication date: 23 November 2012

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195911003822

Recommendations

• Geodesic Disks and Clustering in a Simple Polygon
• scientific article; zbMATH DE number 4051002
• Computing the geodesic center of a simple polygon

zbMATH Keywords

clusteringgeodesic disk

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On enclosing k points by a circle
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Iterated nearest neighbors and finding minimal polytopes
• Computing the geodesic center of a simple polygon
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• On the geodesic Voronoi diagram of point sites in a simple polygon
• Ray shooting in polygons using geodesic triangulations
• Static and Dynamic Algorithms for k-Point Clustering Problems

Cited In (7)

• Piercing pairwise intersecting geodesic disks
• Geodesic order types
• Geodesic Disks and Clustering in a Simple Polygon
• Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
• The geodesic 2-center problem in a simple polygon
• Relative convex hulls in semi-dynamic arrangements
• Geodesic order types

This page was built for publication: Geodesic disks and clustering in a simple polygon

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