An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
From MaRDI portal
Publication:3449806
DOI10.1007/978-3-319-21840-3_6zbMath1444.68273MaRDI QIDQ3449806
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_6
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon, The hamburger theorem, Polynomial Time Algorithms for Bichromatic Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balanced line for a 3-colored point set in the plane
- Balanced partitions of 3-colored geometric sets in the plane
- Maintenance of configurations in the plane
- Applications of a semi-dynamic convex hull algorithm
- Algorithms for ham-sandwich cuts
- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane
- Geometry Helps in Matching
- Buckets, Heaps, Lists, and Monotone Priority Queues
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications