Fixed-orientation equilateral triangle matching of point sets

DOI10.1016/J.TCS.2013.11.031MaRDI QIDQ744055zbMATHOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 4070353 (Why is no real title available?)
• Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
• Geometric Spanner Networks
• Graph theory
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Matching points with rectangles and squares
• Matching points with squares
• On the stretch factor of convex Delaunay graphs
• There are planar graphs almost as good as the complete graph

Cited in

(4)

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

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)