Daftar Isi: Weak Matching Points with Triangles

Main Authors:	Fatemeh Panahi, Ali Mohades, Mansoor Davoodi, Marzieh Eskandari
Format:	Proceeding Journal
Bahasa:	eng
Terbitan:	, 2011
Subjects:	Computational Geometry Computer Science Visibility Voronoi Diagram Computational Complexity Algorithm Facility Location Symbolic layout visibility dynamic programming VLSI design K-Center Problem; Farthest Point Voronoi Diagram; Center Hull Hybrid Optimization Algorithm Support Vector Machine Whale Optimization Algorithm Dragonfly Algorithm Feature Selection Art Gallery k-modem Illumination Guarding Competitive Facility Location Voronoi Game Game Theory
Online Access:	https://zenodo.org/record/4827228

Daftar Isi:

In this paper, we study the weak point matching prob- lem for a given set of n points and a class of equilateral triangles. The problem is to find the maximum car- dinality matching of the points using equilateral trian- gles such that each triangle contains exactly two points and each point lies at most in one triangle. Under the non-degeneracy assumption, we present an O(n3/2) time algorithm using the TD-Delaunay graph and a graph matching algorithm. Also, we show that the lower bound for the number of matched points is b2n/3c which is optimal in the worst case.