Fixed-orientation equilateral triangle matching of point sets

DOI10.1016/J.TCS.2013.11.031zbMATH Open1380.68377OpenAlexW2170431684MaRDI QIDQ744055FDOQ744055

Authors: Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel 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

Recommendations

• Fixed-orientation equilateral triangle matching of point sets
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
• Strong matching of points with geometric shapes
• Triangulations intersect nicely

zbMATH Keywords

matchinggeometric graphsDelaunay graphshalf-\(\Theta_6\) graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Graph theory
• Geometric Spanner Networks
• There are planar graphs almost as good as the complete graph
• Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
• On the stretch factor of convex Delaunay graphs
• Matching points with squares
• Title not available (Why is that?)
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Matching points with rectangles and squares

Cited In (4)

• Matchings in higher-order Gabriel graphs
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• Fixed-orientation equilateral triangle matching of point sets
• Strong matching of points with geometric shapes

This page was built for publication: Fixed-orientation equilateral triangle matching of point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744055)