:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Duque, Frank
Format:	Preprint
Published:	2023
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2312.02827
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized k-Cell Decomposition for Visibility Planning in Polygons
by: Bahoo, Yeganeh, et al.
Published: (2025)

Crossing lemmas for $k$-systems of arcs
by: Hubard, Alfredo, et al.
Published: (2024)

Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)

Hybrid k-Clustering: Blending k-Median and k-Center
by: Fomin, Fedor V., et al.
Published: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)

On connections between k-coloring and Euclidean k-means
by: Aman, Enver, et al.
Published: (2024)

Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
by: Wang, Pengfei, et al.
Published: (2026)

A Couple of Simple Algorithms for $k$-Dispersion
by: Chen, Ke, et al.
Published: (2025)

An $(\aleph_0,k+2)$-Theorem for $k$-Transversals
by: Keller, Chaya, et al.
Published: (2023)

Min-$k$-planar Drawings of Graphs
by: Binucci, Carla, et al.
Published: (2023)

On Spheres with $k$ Points Inside
by: Edelsbrunner, Herbert, et al.
Published: (2024)

On $k$-Plane Insertion into Plane Drawings
by: Katheder, Julia, et al.
Published: (2024)

Saturated Drawings of Geometric Thickness k
by: Bachmann, Patricia, et al.
Published: (2025)

Multi-Swap $k$-Means++
by: Beretta, Lorenzo, et al.
Published: (2023)

The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)

Embedding Graphs as Euclidean kNN-Graphs
by: Schibler, T., et al.
Published: (2025)

Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search
by: Spalding-Jamieson, Jack, et al.
Published: (2025)

On the size of k-irreducible triangulations
by: Delecroix, Vincent, et al.
Published: (2026)

Optimizing Symbol Visibility through Displacement
by: Gärtner, Bernd, et al.
Published: (2023)

Euclidean k-center Fair Clusterings
by: Moritaka, Ayano, et al.
Published: (2025)

Top-k Stabbing Interval Queries
by: Akram, Waseem, et al.
Published: (2024)

Pathwidth of 2-Layer $k$-Planar Graphs
by: Okada, Yuto
Published: (2025)

$k$-means considered harmful: On arbitrary topological changes in Mapper complexes
by: Vejdemo-Johansson, Mikael
Published: (2025)

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

Faster Approximation Scheme for Euclidean $k$-TSP
by: van Wijland, Ernest, et al.
Published: (2023)

Efficient Enumeration of At Most $k$-Out Polygons
by: Akram, Waseem, et al.
Published: (2025)

Morse Theory for the k-NN Distance Function
by: Reani, Yohai, et al.
Published: (2024)

Fast Approximations and Coresets for (k, l)-Median under Dynamic Time Warping
by: Conradi, Jacobus, et al.
Published: (2023)

Bounds for k-centers of point sets under $L_{\infty}$-bottleneck distance
by: Bierwirth, Mats, et al.
Published: (2025)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

Fine-Grained Complexity of Continuous Euclidean k-Center
by: Blank, Lotte, et al.
Published: (2026)

Recognizing 2-Layer and Outer $k$-Planar Graphs
by: Kobayashi, Yasuaki, et al.
Published: (2024)

Near-Optimal Bounds for Parameterized Euclidean k-means
by: Cohen-Addad, Vincent, et al.
Published: (2026)

$k$-dimensional transversals for fat convex sets
by: Jung, Attila, et al.
Published: (2023)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
by: Huang, Lingxiao, et al.
Published: (2022)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
by: Gajjala, Rishikesh, et al.
Published: (2024)

On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025)

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
by: Mikula, Jan, et al.
Published: (2025)

Performance bounds for nearest neighbor search with k-d trees
by: Bazzani, Marco, et al.
Published: (2026)

On Tight Robust Coresets for $k$-Medians Clustering
by: Huang, Lingxiao, et al.
Published: (2025)