Results 101 to 110 of about 655,112 (194)

Spanning Properties of Variants of the Delaunay Graph (Invited Talk).

, 2021
A weighted geometric graph G is a graph whose n vertices are points in the plane and whose m edges are line segments weighted by the Euclidean distance between their endpoints. A t-spanner of G is a connected spanning subgraph G' with the property that for every pair of vertices x, y, the shortest path from x to y in G' has weight at most t ≥ 1 times ...
openaire   +3 more sources

Harmonic deformation of the Delaunay triangulation

, 2009
Dado um processo de Poisson d-dimensional, construímos funções harmônicas na triangulação de Delaunay associada, com comportamento assintótico linear, como limite de um processo de harness sem ruído. Tais funções permitem que construamos uma nova imersão
Rafael de Mattos Grisi, Grisi, Rafael de Mattos   +1 more
core   +1 more source

Delaunay Decompositions Minimizing Energy of Weighted Toroidal Graphs [PDF]

Discrete & Computational Geometry
Given a weighted toroidal graph, each realization to a Euclidean torus is associated with the Dirichlet energy. By minimizing the energy over all possible Euclidean structures and over all realizations within a fixed homotopy class, one obtains a harmonic map into an optimal Euclidean torus.
openaire   +2 more sources

Redrawing a Graph within a Geometric Tolerance

, 1995
In this paper we investigate some applications of the concept of tolerance to graph drawing. Given a geometric structure, the tolerance is a measure of how much the set of points can be arbitrarily changed while preserving the structure. Then, if we have
Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos, Abellanas, Manuel, Ramos, Pedro, Hurtado, Ferran   +5 more
core   +1 more source

Characterizing Delaunay Graphs via Fixed Point Theorem [PDF]

, 2020
This paper discusses a problem for determining whether a given plane graph is a Delaunay graph, i.e., whether it is topologically equivalent to a Delaunay triangulation.
Yuichiro Miyamoto, Tomomi Matsui
core  

Quadrotor Trajectory Planning with Tetrahedron Partitions and B-Splines in Unknown and Dynamic Environments

Robotics
Trajectory planning is a key task in unmanned aerial vehicle navigation systems. Although trajectory planning in the presence of obstacles is a well-understood problem, unknown and dynamic environments still present significant challenges. In this paper,
Jiayu Men, Jesús Requena Carrión
doaj   +1 more source

A certified conflict locator for the incremental maintenance of the Delaunay graph of semi-algebraic sets [PDF]

, 2004
Most of the curves and surfaces encountered in geometric modelling are defined as the set of solutions of a system of algebraic equations or inequalities (semi-algebraic sets).
Anton, François
core   +1 more source

Markov Paths on the Poisson-Delaunay Graph with applications to routing in mobile networks [PDF]

, 1998
Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a planar Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line defines a path on the Delaunay graph.
Baccelli, François, Tchoumatchenko, Konstantin, Zuyev, Sergei   +2 more
core   +1 more source

Degrees in the $β$- and $β'$-Delaunay graphs

32 pages, 7 ...
Bonnet, Gilles, Gordon, Joseph
openaire   +2 more sources

Unbiased Finite Element Mesh Delaunay Constrained Triangulation Applied to 2D Images with High Morphological Complexity Using Mathematical Morphology Tools Part 1: Binary Images

Computation
We propose a method for establishing a Constrained Delaunay Triangulation CDT applied to 2D binary images of high morphological complexity. A prerequisite for CDT is the unbiased definition of the Planar Straight-Line Graph PSLG, which must respect the ...
Franck N’Guyen, Toufik Kanit, Abdellatif Imad   +2 more
doaj   +1 more source