Flip distance to some plane configurations
From MaRDI portal
Publication:2331207
DOI10.1016/j.comgeo.2019.01.008zbMath1425.05044arXiv1905.00791OpenAlexW2921666111WikidataQ128301484 ScholiaQ128301484MaRDI QIDQ2331207
Anil Maheshwari, Ahmad Biniaz, Michiel H. M. Smid
Publication date: 25 October 2019
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.00791
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
On the longest flip sequence to untangle segments in the plane, Complexity results on untangling red-blue matchings, Bounded-angle minimum spanning trees
Cites Work
- Unnamed Item
- Unnamed Item
- Non-crossing matchings of points with geometric objects
- Flip distance between triangulations of a simple polygon is NP-complete
- Compatible geometric matchings
- Flips in planar graphs
- Nearest neighbor queries in metric spaces
- Cutting dense point sets in half
- Flipping edges in triangulations
- Lines, line-point incidences and crossing families in dense sets
- Disjoint compatible geometric matchings
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Bichromatic compatible matchings
- Compatible spanning trees
- Transforming triangulations
- A Bottleneck Matching Problem with Edge-Crossing Constraints
- A History of Flips in Combinatorial Triangulations
- The Number of Flips Required to Obtain Non-crossing Convex Cycles
