Fixed-orientation equilateral triangle matching of point sets
From MaRDI portal
Publication:744055
DOI10.1016/j.tcs.2013.11.031zbMath1380.68377OpenAlexW2170431684MaRDI QIDQ744055
Ahmad Biniaz, Jasine Babu, Anil Maheshwari, Michiel H. M. Smid
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.031
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Strong matching of points with geometric shapes ⋮ Higher-order triangular-distance Delaunay graphs: graph-theoretical properties ⋮ Matchings in higher-order Gabriel graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Matching points with rectangles and squares
- Matching points with squares
- Lower bounds on the cardinality of the maximum matchings of planar graphs
- There are planar graphs almost as good as the complete graph
- On the stretch factor of convex Delaunay graphs
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Geometric Spanner Networks
This page was built for publication: Fixed-orientation equilateral triangle matching of point sets
