:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Broek, Steven van den, Meulemans, Wouter, Speckmann, Bettina
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2402.13340
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

SimpleSets: Capturing Categorical Point Patterns with Simple Shapes
by: Broek, Steven van den, et al.
Published: (2024)

Summarizing Classed Region Maps with a Disk Choreme
by: Broek, Steven van den, et al.
Published: (2025)

Minimizing Vertical Length in Linked Bar Charts
by: Broek, Steven van den, et al.
Published: (2025)

A Framework for Algorithm Stability
by: Meulemans, Wouter, et al.
Published: (2017)

BlockSets: A Structured Visualization for Sets with Large Elements
by: Novakova, Neda, et al.
Published: (2025)

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

ParkView: Visualizing Monotone Interleavings
by: Beurskens, Thijs, et al.
Published: (2025)

Noisy Graph Patterns via Ordered Matrices
by: Wulms, Jules, et al.
Published: (2026)

Unfolding Ordered Matrices into BioFabric Motifs
by: Wulms, Jules, et al.
Published: (2026)

Visual Complexity of Point Set Mappings
by: Meulemans, Wouter, et al.
Published: (2024)

Polycubes via Dual Loops
by: Snoep, Maxim, et al.
Published: (2024)

Robust Construction of Polycube Segmentations via Dual Loops
by: Snoep, Maxim, et al.
Published: (2024)

Fast Reconfiguration for Programmable Matter
by: Kostitsyna, Irina, et al.
Published: (2022)

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

Locally Correct Interleavings between Merge Trees
by: Beurskens, Thijs, et al.
Published: (2025)

Faster Fréchet Distance Approximation through Truncated Smoothing
by: van der Horst, Thijs, et al.
Published: (2024)

A near-linear time exact algorithm for the $L_1$-geodesic Fréchet distance between two curves on the boundary of a simple polygon
by: van der Horst, Thijs, et al.
Published: (2025)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
by: van der Horst, Thijs, et al.
Published: (2025)

Capturing the Shape of a Point Set with a Line Segment
by: van Beusekom, Nathan, et al.
Published: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)

A Greedy Algorithm for Low-Crossing Partitions for General Set Systems
by: Csikós, Mónika, et al.
Published: (2025)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

On the Number of Almost Empty Monochromatic Triangles
by: Bhattacharya, Bhaswar B., et al.
Published: (2026)

Efficient Greedy Discrete Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2025)

Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)

Greedy Routing Reachability Games
by: Lenzner, Pascal, et al.
Published: (2026)

Outperforming the Best 1D Low-Discrepancy Constructions with a Greedy Algorithm
by: Clément, François
Published: (2024)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
by: Eppstein, David
Published: (2025)

No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)

Error Resilient Space Partitioning
by: Dunkelman, Orr, et al.
Published: (2020)

Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)

Covering and Partitioning Complex Objects with Small Pieces
by: Aamand, Anders, et al.
Published: (2026)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
by: Damian, Mirela, et al.
Published: (2003)

Minimum Star Partitions of Simple Polygons in Polynomial Time
by: Abrahamsen, Mikkel, et al.
Published: (2023)

Minimum Partition of Polygons under Width and Cut Constraints
by: Chung, Jaehoon, et al.
Published: (2025)

Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
by: Biedl, Therese, et al.
Published: (2024)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
by: Le, Hung, et al.
Published: (2021)

Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
by: Agarwal, Pankaj K., et al.
Published: (2024)

Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
by: Aronov, Boris, et al.
Published: (2019)