:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bergold, Helena, Das, Arun Kumar, Lauff, Robert, Scheucher, Manfred, Schröder, Felix, Sieper, Marie Diana
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2503.05178
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Investigating Simple Drawings of $K_n$ using SAT
by: Bergold, Helena, et al.
Published: (2025)

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

Topological Drawings meet Classical Theorems from Convex Geometry
by: Bergold, Helena, et al.
Published: (2020)

Finding hardness reductions automatically using SAT solvers
by: Bergold, Helena, et al.
Published: (2024)

Plane Hamiltonian Cycles in Convex Drawings
by: Bergold, Helena, et al.
Published: (2024)

Asymmetric Separation Problem for Bichromatic Point Set
by: Maji, Sukanya, et al.
Published: (2024)

Happy Ending: An Empty Hexagon in Every Set of 30 Points
by: Heule, Marijn J. H., et al.
Published: (2024)

Subgraph-universal planar graphs for trees
by: Bergold, Helena, et al.
Published: (2024)

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
by: Klemz, Boris, et al.
Published: (2024)

Morphing Graph Drawings in the Presence of Point Obstacles
by: Firman, Oksana, et al.
Published: (2023)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
by: Blažej, Václav, et al.
Published: (2024)

Clustered Planarity Variants for Level Graphs
by: Fink, Simon D., et al.
Published: (2024)

Arrangements of Pseudocircles: On Digons and Triangles
by: Felsner, Stefan, et al.
Published: (2022)

Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)

On Triangles in Colored Pseudoline Arrangements
by: Radtke, Yan Alves, et al.
Published: (2026)

An Improved Lower Bound on the Number of Pseudoline Arrangements
by: Kühnast, Fernando Cortés, et al.
Published: (2024)

Robust Classification of Dynamic Bichromatic point Sets in R2
by: Glazenburg, Erwin, et al.
Published: (2024)

Garment numbers of bi-colored point sets in the plane
by: Aichholzer, Oswin, et al.
Published: (2026)

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

Subset Selection Problems in Planar Point Sets
by: Balogh, József, et al.
Published: (2024)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
by: Cabello, Sergio, et al.
Published: (2021)

Multipacking in Euclidean Metric Space
by: Das, Arun Kumar, et al.
Published: (2024)

On Small Pair Decompositions for Point Sets
by: Buchin, Kevin, et al.
Published: (2026)

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

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
by: Lynch, Jayson, et al.
Published: (2025)

Edge-Constrained Hamiltonian Paths on a Point Set
by: Antić, Todor, et al.
Published: (2025)

Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
by: Spalding-Jamieson, Jack, et al.
Published: (2025)

Constructions of Large m-Distance Sets on Triangular Lattice
by: Bao, Li-Ren, et al.
Published: (2025)

Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning
by: Thacher, Will, et al.
Published: (2025)

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

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

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

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2024)

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials
by: Bui, Hong Duc
Published: (2025)

Three Edge-disjoint Plane Spanning Paths in a Point Set
by: Kindermann, Philipp, et al.
Published: (2023)

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

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2026)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

Geometric Points in Tensor Triangular Geometry
by: Barthel, Tobias, et al.
Published: (2026)

How many times can two minimum spanning trees cross?
by: Antić, Todor, et al.
Published: (2026)