Image de couverture de livre

BlockSets: A Structured Visualization for Sets with Large Elements

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Novakova, Neda, Todorov, Veselin, Broek, Steven van den, Dwyer, Tim, Speckmann, Bettina
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

SimpleSets: Capturing Categorical Point Patterns with Simple Shapes
par: Broek, Steven van den, et autres
Publié: (2024)

Greedy Monochromatic Island Partitions
par: Broek, Steven van den, et autres
Publié: (2024)

Summarizing Classed Region Maps with a Disk Choreme
par: Broek, Steven van den, et autres
Publié: (2025)

ParkView: Visualizing Monotone Interleavings
par: Beurskens, Thijs, et autres
Publié: (2025)

Capturing the Shape of a Point Set with a Line Segment
par: van Beusekom, Nathan, et autres
Publié: (2024)

Locally Correct Interleavings between Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2025)

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

Minimizing Vertical Length in Linked Bar Charts
par: Broek, Steven van den, et autres
Publié: (2025)

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
par: van der Horst, Thijs, et autres
Publié: (2025)

Faster Fréchet Distance Approximation through Truncated Smoothing
par: van der Horst, Thijs, et autres
Publié: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

Polycubes via Dual Loops
par: Snoep, Maxim, et autres
Publié: (2024)

Robust Construction of Polycube Segmentations via Dual Loops
par: Snoep, Maxim, et autres
Publié: (2024)

Fast Reconfiguration for Programmable Matter
par: Kostitsyna, Irina, et autres
Publié: (2022)

Bounds for k-centers of point sets under $L_{\infty}$-bottleneck distance
par: Bierwirth, Mats, et autres
Publié: (2025)

Visual Complexity of Point Set Mappings
par: Meulemans, Wouter, et autres
Publié: (2024)

A Framework for Algorithm Stability
par: Meulemans, Wouter, et autres
Publié: (2017)

Optimizing Symbol Visibility through Displacement
par: Gärtner, Bernd, et autres
Publié: (2023)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
par: Bhore, Sujoy, et autres
Publié: (2026)

Minimum Membership Geometric Set Cover in the Continuous Setting
par: Govindarajan, Sathish, et autres
Publié: (2025)

Robust Bichromatic Classification using Two Lines
par: Glazenburg, Erwin, et autres
Publié: (2024)

Translational Aperiodic Sets of 7 Polyominoes
par: Yang, Chao, et autres
Publié: (2024)

Deciding Connectivity in Symmetric Semi-Algebraic Sets
par: Riener, Cordian., et autres
Publié: (2025)

On the $\ell_0$ Isoperimetric Coefficient of Measurable Sets
par: Fernandez V, Manuel
Publié: (2023)

Online Geometric Hitting Set and Set Cover Beyond Unit Balls in $\mathbb{R}^2$
par: De, Minati, et autres
Publié: (2023)

On Triangular Separation of Bichromatic Point Sets
par: Bergold, Helena, et autres
Publié: (2025)

On Small Pair Decompositions for Point Sets
par: Buchin, Kevin, et autres
Publié: (2026)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
par: Tkachenko, Anastasiia, et autres
Publié: (2024)

Online Hitting Set for Axis-Aligned Squares
par: De, Minati, et autres
Publié: (2025)

Asymmetric Separation Problem for Bichromatic Point Set
par: Maji, Sukanya, et autres
Publié: (2024)

Online Hitting Sets for Disks of Bounded Radii
par: De, Minati, et autres
Publié: (2024)

A Practical Approach for Computing the Diameter of a Point Set
par: Har-Peled, Sariel
Publié: (2025)

Witness Set: A Visibility Problem in $NP\cap XP$
par: Jana, Satyabrata, et autres
Publié: (2026)

Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^3$
par: Park, Eunku
Publié: (2026)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
par: Garcia, Javier, et autres
Publié: (2025)

On the Undecidability of Tiling the $3$-dimensional Space with a Set of $3$ Polycubes
par: Yang, Chao, et autres
Publié: (2025)

Edge-Constrained Hamiltonian Paths on a Point Set
par: Antić, Todor, et autres
Publié: (2025)

An Overview of Minimum Convex Cover and Maximum Hidden Set
par: Browne, Reilly
Publié: (2024)

A Greedy Algorithm for Low-Crossing Partitions for General Set Systems
par: Csikós, Mónika, et autres
Publié: (2025)

Subset Selection Problems in Planar Point Sets
par: Balogh, József, et autres
Publié: (2024)