Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated. We first consider some of the most common proximity graphs of the family of …
Vortical flow patterns generated by swimming animals or flow separation (eg behind bluff objects such as cylinders) provide important insight to global flow behaviour such as fluid …
JSB Mitchell - Handbook of Discrete and Computational …, 2017 - taylorfrancis.com
The notion of distance is fundamental to many aspects of computational geometry. A classic approach to characterize the distance properties of planar (and high-dimensional) point sets …
Y Higashikawa, N Katoh… - International Journal of …, 2023 - Taylor & Francis
We investigate the Euclidean minimum weight Laman graph on a planar point set P, MLG (P) for short. Bereg et al.(2016) studied geometric properties of MLG (P) and showed that the …
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 …
Y KAWAKAMI, S TAKAHASHI, K SETO… - … on Information and …, 2024 - search.ieice.org
We explore the maximum total number of edge crossings and the maximum geometric thickness of the Euclidean minimum-weight (k, ℓ)-tight graph on a planar point set P. In this …
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 …
Y Kobayashi, Y Higashikawa, N Katoh - Computing and Combinatorics …, 2021 - Springer
We investigate the total number of edge crossings (ie, the crossing number) of the Euclidean minimum weight Laman graph MLG (P) MLG (P) on a planar point set P. Bereg et al.(2016) …
MP Cano Vila - 2020 - repository.library.carleton.ca
This thesis studies different generalizations of Delaunay triangulations, both from a combinatorial and algorithmic point of view. The Delaunay triangulation of a point set S …