World on data perspective
MKM Nasution - World, 2022 - mdpi.com
It is not simple to consider the world from only one side, but analyzing all sides can cloud
comprehension without reaching deep insight found at the core. In a word as a whole, there …
comprehension without reaching deep insight found at the core. In a word as a whole, there …
[HTML][HTML] Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties
A Biniaz, A Maheshwari, M Smid - Computational Geometry, 2015 - Elsevier
We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a
set P of points in general position in the plane. In TD-Delaunay, the convex distance is …
set P of points in general position in the plane. In TD-Delaunay, the convex distance is …
Covering and packing with homothets of limited capacity
OS Pi - arXiv preprint arXiv:2211.09328, 2022 - arxiv.org
This work revolves around the two following questions: Given a convex body $
C\subset\mathbb {R}^ d $, a positive integer $ k $ and a finite set $ S\subset\mathbb {R}^ d …
C\subset\mathbb {R}^ d $, a positive integer $ k $ and a finite set $ S\subset\mathbb {R}^ d …
[HTML][HTML] Matchings in higher-order Gabriel graphs
A Biniaz, A Maheshwari, M Smid - Theoretical Computer Science, 2015 - Elsevier
Given a set P of n points in the plane, the order-k Gabriel graph on P, denoted by k-GG, has
an edge between two points p and q if and only if the closed disk with diameter pq contains …
an edge between two points p and q if and only if the closed disk with diameter pq contains …
[HTML][HTML] Strong matching of points with geometric shapes
A Biniaz, A Maheshwari, M Smid - Computational Geometry, 2018 - Elsevier
Let P be a set of n points in general position in the plane. Given a convex geometric shape
S, a geometric graph GS (P) on P is defined to have an edge between two points if and only …
S, a geometric graph GS (P) on P is defined to have an edge between two points if and only …
Selection lemmas for various geometric objects
Selection lemmas are classical results in discrete geometry that have been well studied and
have applications in many geometric problems like weak epsilon nets and slimming …
have applications in many geometric problems like weak epsilon nets and slimming …
Matching in Gabriel graphs
A Biniaz, A Maheshwari, M Smid - arXiv preprint arXiv:1410.0540, 2014 - arxiv.org
Given a set $ P $ of $ n $ points in the plane, the order-$ k $ Gabriel graph on $ P $, denoted
by $ k $-$ GG $, has an edge between two points $ p $ and $ q $ if and only if the closed …
by $ k $-$ GG $, has an edge between two points $ p $ and $ q $ if and only if the closed …
Maximum Matchings and Minimum Blocking Sets in-Graphs
Abstract\varTheta _6-graphs are important geometric graphs that have many applications
especially in wireless sensor networks. They are equivalent to Delaunay graphs where …
especially in wireless sensor networks. They are equivalent to Delaunay graphs where …
Maximum Matchings and Minimum Blocking Sets in -Graphs
$\Theta_6 $-Graphs graphs are important geometric graphs that have many applications
especially in wireless sensor networks. They are equivalent to Delaunay graphs where …
especially in wireless sensor networks. They are equivalent to Delaunay graphs where …
Matching and covering with boxes
J Rojas Ledesma - 2018 - repositorio.uchile.cl
El estudio de las interacciones entre cajas multi-dimensionales (es decir, hiperrectángulos d-
dimensionales alineados a los ejes) ha encontrado aplicaciones en distintas áreas …
dimensionales alineados a los ejes) ha encontrado aplicaciones en distintas áreas …