Fixed-Orientation Equilateral Triangle Matching of Point Sets
Jasine Babu, Ahmad Biniaz, Anil Maheshwari, Michiel Smid

TL;DR
This paper studies geometric graphs formed by connecting points with downward equilateral triangles, establishing bounds on matchings and structural properties, and relating these graphs to well-known geometric graph classes.
Contribution
It proves lower bounds on matchings in downward equilateral triangle graphs and explores structural properties of combined upward and downward triangle graphs, linking them to $ heta_6$ graphs.
Findings
Matching size at least $rac{n-2}{3}$ for downward triangle graphs.
Block cut point graph of combined triangle graphs is a path.
Maximum edges in $ heta_6$ graphs is $5n-11$.
Abstract
Given a point set and a class of geometric objects, is a geometric graph with vertex set such that any two vertices and are adjacent if and only if there is some containing both and but no other points from . We study graphs where is the class of downward equilateral triangles (ie. equilateral triangles with one of their sides parallel to the x-axis and the corner opposite to this side below that side). For point sets in general position, these graphs have been shown to be equivalent to half- graphs and TD-Delaunay graphs. The main result in our paper is that for point sets in general position, always contains a matching of size at least and this bound cannot be improved above…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · 3D Shape Modeling and Analysis · 3D Modeling in Geospatial Applications
