Image de couverture de livre

Boundary Labeling in a Circular Orbit

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bonerath, Annika, Nöllenburg, Martin, Terziadis, Soeren, Wallinger, Markus, Wulms, Jules
Format:	Preprint
Publié:	2024
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

Clarity and Computational Efficiency of Orbital Boundary Labeling
par: Wallinger, Markus, et autres
Publié: (2026)

Constrained Boundary Labeling
par: Depian, Thomas, et autres
Publié: (2024)

Transitions in Dynamic Point Labeling
par: Depian, Thomas, et autres
Publié: (2022)

StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data
par: Wallinger, Markus, et autres
Publié: (2025)

Saturated Drawings of Geometric Thickness k
par: Bachmann, Patricia, et autres
Publié: (2025)

On Solving Simple Curved Nonograms
par: Löffler, Maarten, et autres
Publié: (2025)

Optimizing Staircase Motifs in Biofabric Network Layouts
par: Sara Di Bartolomeo, et autres
Publié: (2025)

Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
par: Löffler, Maarten, et autres
Publié: (2024)

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

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
par: Förster, Henry, et autres
Publié: (2023)

Visualizing Extensions of Argumentation Frameworks as Layered Graphs
par: Nöllenburg, Martin, et autres
Publié: (2024)

Competitive Searching over Terrains
par: de Berg, Sarita, et autres
Publié: (2024)

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

The Complexity of Geodesic Spanners using Steiner Points
par: de Berg, Sarita, et autres
Publié: (2024)

Realizing Planar Linkages in Polygonal Domains
par: Depian, Thomas, et autres
Publié: (2026)

Using Reinforcement Learning to Optimize the Global and Local Crossing Number
par: Brand, Timo, et autres
Publié: (2025)

The Complexity of Extending Storylines with Minimum Local Crossing Number
par: Dobler, Alexander, et autres
Publié: (2026)

Pathways to Tractability for Geometric Thickness
par: Depian, Thomas, et autres
Publié: (2024)

The Parameterized Complexity of Extending Stack Layouts
par: Depian, Thomas, et autres
Publié: (2024)

The Peculiarities of Extending Queue Layouts
par: Depian, Thomas, et autres
Publié: (2025)

Visualizing Treewidth
par: Chiu, Alvin, et autres
Publié: (2025)

tue-alga/NoisyGraphPatterns: Noisy Graph Patterns via Ordered Matrices
par: JulesWulms
Publié: (2026)

An Algorithm for Illuminating $n$ Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem
par: Sukkasem, Phapaengmuang, et autres
Publié: (2025)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
par: Dobler, Alexander, et autres
Publié: (2024)

Noisy Graph Patterns via Ordered Matrices
par: Wulms, Jules, et autres
Publié: (2026)

Unfolding Ordered Matrices into BioFabric Motifs
par: Wulms, Jules, et autres
Publié: (2026)

Rendering string diagrams recursively
par: Rubio-Madrigal, Celia, et autres
Publié: (2024)

Contiguous Boundary Guarding
par: Biniaz, Ahmad, et autres
Publié: (2024)

Symplectification of Circular Arcs and Arc Splines
par: Gössner, Stefan
Publié: (2025)

Determination Problems for Orbit Closures and Matrix Groups
par: Manssour, Rida Ait El, et autres
Publié: (2024)

Hoop Diagrams: A Set Visualization Method
par: Rodgers, Peter, et autres
Publié: (2024)

Higher Order Continuity for Smooth As-Rigid-As-Possible Shape Modeling
par: Oehri, Annika, et autres
Publié: (2025)

An Improved Quasi-Physical Dynamic Algorithm for Efficient Circular Coverage in Arbitrary Convex
par: Yi, Zeping, et autres
Publié: (2026)

Efficient Computation of the Directional Extremal Boundary of a Union of Equal-Radius Circles
par: Gribov, Alexander
Publié: (2025)

The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard
par: Stade, Jack
Publié: (2022)

Counting Unit Circular Arc Intersections
par: Wang, Haitao
Publié: (2026)

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
par: Wetzels, Florian, et autres
Publié: (2023)

Poincar{é} Duality, Degeneracy, and Real Lefschetz Property for T-Hypersurfaces
par: Chenal, Jules
Publié: (2023)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
par: Damian, Mirela, et autres
Publié: (2003)

Real Toric Varieties: Interactions between their Geometry and their Topology
par: Chenal, Jules, et autres
Publié: (2025)