ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Fixed-orientation equilateral triangle matching of point sets

Babu, Jasine and Biniaz, Ahmad and Maheshwari, Anil and Smid, Michiel (2014) Fixed-orientation equilateral triangle matching of point sets. In: THEORETICAL COMPUTER SCIENCE, 555 . pp. 55-70.

[img] PDF
the_com_sci_555_55_2014.pdf - Published Version
Restricted to Registered users only

Download (680kB) | Request a copy
Official URL: http://dx.doi.org/ 10.1016/j.tcs.2013.11.031

Abstract

Given a point set P and a class C of geometric objects, G(C)(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacent if and only if there is some C is an element of C containing both p and q but no other points from P. We study G(del)(P) graphs where del is the class of downward equilateral triangles (i.e., 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-Theta(6) graphs and TD-Delaunay graphs. The main result in our paper is that for point sets P in general position, G(del)(P) always contains a matching of size at least vertical bar P vertical bar-1/3] and this bound is tight. We also give some structural properties of G(star)(P) graphs, where is the class which contains both upward and downward equilateral triangles. We show that for point sets in general position, the block cut point graph of G(star)(P) is simply a path. Through the equivalence of G(star)(P) graphs with Theta(6) graphs, we also derive that any Theta(6) graph can have at most 5n-11 edges, for point sets in general position. (C) 2013 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Publication: THEORETICAL COMPUTER SCIENCE
Publisher: ELSEVIER SCIENCE BV
Additional Information: Copy right for this article belongs to the ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Keywords: Geometric graphs; Delaunay graphs; Half-Theta(6) graphs; Matching
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 28 Nov 2014 04:39
Last Modified: 28 Nov 2014 04:39
URI: http://eprints.iisc.ac.in/id/eprint/50326

Actions (login required)

View Item View Item