Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Mobile phone data analysis: A spatial exploration toward hotspot detection
The percentage of processed large-scale heterogeneous data is exploding and technology
is the most obvious reason for the big data issue. Nowadays, the results of data expansion …
is the most obvious reason for the big data issue. Nowadays, the results of data expansion …
Proximity graphs: E, δ, Δ, χ and ω
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 …
investigated. We first consider some of the most common proximity graphs of the family of …
Quantitative classification of vortical flows based on topological features using graph matching
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 …
objects such as cylinders) provide important insight to global flow behaviour such as fluid …
Proximity algorithms
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 …
approach to characterize the distance properties of planar (and high-dimensional) point sets …
[HTML][HTML] Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties
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 …
Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs
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 …
(P) for short. Bereg et al.(2016) studied geometric properties of MLG (P) and showed that the …
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2, 2)-Tight Graphs
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 …
thickness of the Euclidean minimum-weight (k, ℓ)-tight graph on a planar point set P. In this …
[HTML][HTML] Matchings in higher-order Gabriel graphs
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] On the edge crossing properties of Euclidean minimum weight Laman graphs
This paper is concerned with the crossing number of Euclidean minimum-weight Laman
graphs in the plane. We first investigate the relation between the Euclidean minimum-weight …
graphs in the plane. We first investigate the relation between the Euclidean minimum-weight …
Generalized Delaunay triangulations: Graph-theoretic properties and Algorithms
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 …
combinatorial and algorithmic point of view. The Delaunay triangulation of a point set S …