Cover Image

SimpleSets: Capturing Categorical Point Patterns with Simple Shapes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Broek, Steven van den, Meulemans, Wouter, Speckmann, Bettina
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Greedy Monochromatic Island Partitions
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)

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

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

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)

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

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

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

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

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

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

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)

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

Compatible Triangulations of Simple Polygons
by: Afshani, Peyman, et al.
Published: (2026)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
by: Fekete, Sándor P., et al.
Published: (2024)

Visibility Queries in Simple Polygons
by: Bhore, Sujoy, et al.
Published: (2026)

Covering Simple Orthogonal Polygons with Rectangles
by: Roy, Aniket Basu
Published: (2024)

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

Multirobot Watchman Routes in a Simple Polygon
by: Mitchell, Joseph S. B., et al.
Published: (2024)

Computing the Fréchet Distance When Just One Curve is $c$-Packed: A Simple Almost-Tight Algorithm
by: Conradi, Jacobus, et al.
Published: (2025)

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

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

Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)

A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)

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

A Simple Partially Embedded Planarity Test Based on Vertex-Addition
by: Fink, Simon D., et al.
Published: (2024)

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

SimpliCity: Reconstructing Buildings with Simple Regularized 3D Models
by: Bauchet, Jean-Philippe, et al.
Published: (2024)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

Simple Linear Loops: Algebraic Invariants and Applications
by: Manssour, Rida Ait El, et al.
Published: (2024)

Holes in Convex and Simple Drawings
by: Bergold, Helena, et al.
Published: (2024)

Dynamic Convex Hulls for Simple Paths
by: Brewer, Bruce, et al.
Published: (2024)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
by: Garcia, Javier, et al.
Published: (2025)