New variants of perfect non-crossing matchings
From MaRDI portal
Publication:831710
DOI10.1007/978-3-030-67899-9_12OpenAlexW3127648435MaRDI QIDQ831710
Marko Savić, Ioannis Mantas, Hendrik Schrezenmaier
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2001.03252
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bottleneck non-crossing matching in the plane
- Long non-crossing configurations in the plane
- Range searching with efficient hierarchical cuttings
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- Applications of a semi-dynamic convex hull algorithm
- Algorithms for ham-sandwich cuts
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Structural properties of bichromatic non-crossing matchings
- Faster bottleneck non-crossing matchings of points in convex position
- A Bottleneck Matching Problem with Edge-Crossing Constraints
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Geometry Helps in Matching
- Improved Grid Map Layout by Point Set Matching
- Computing the extreme distances between two convex polygons
- Fast Matching Algorithms for Points on a Polygon
- Simplex Range Searching and Its Variants: A Review
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Geometry helps in bottleneck matching and related problems
This page was built for publication: New variants of perfect non-crossing matchings
