New variants of perfect non-crossing matchings
From MaRDI portal
Publication:6180638
DOI10.1016/j.dam.2023.09.016MaRDI QIDQ6180638
Ioannis Mantas, Marko Savić, Hendrik Schrezenmaier
Publication date: 2 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Computer science aspects of computer-aided design (68U07) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of algorithms (68W01)
Cites Work
- Unnamed Item
- Unnamed Item
- Bottleneck non-crossing matching 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
- Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours
- Simplex Range Searching and Its Variants: A Review
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
- 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
