Results 91 to 100 of about 681,623 (204)
Parallel constrained Delaunay triangulation
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight line graph consisting of points and segments. The method is based on an incremental insertion, taking special care to avoid conflicts during concurrent insertion of points into the triangulation and concurrent edge flips.
Coll Arnau, Narcís +5 more
openaire +2 more sources
From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be followed around a given set of obstacles.
Lens, Stéphane, Boigelot, Bernard
openaire +3 more sources
Sketch of a Delaunay Triangulation.
The Delaunay triangulation and its dual, the Voronoi tessellation for a random set of points. The blue lines are the segments of the Voronoi tessellation, the red ones are the edges of the Delaunay graph (triangulation).
Matthias Krufczik (749498) +8 more
core +1 more source
Accurate extraction of the centroid axes of beams with variable cross-sections is critical for infrastructure health monitoring. While 3D laser scanning provides dense point clouds, existing methods face challenges due to fixed slicing directions, sparse
Jia Zou +5 more
doaj +1 more source
This study proposes a technique for generating 3D objects from Shapefile-based 2D spatial data and converting them to comply with the CityGML 3.0 standard.
Donghwi Kang +5 more
doaj +1 more source
The Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution.
École Normale +2 more
core
Off-road path planning involves navigating vehicles through areas lacking established road networks, which is critical for emergency response in disaster events, but is limited by the complex geographical environments in natural conditions.
Ting Tian +4 more
doaj +1 more source
Delaunay triangles generated by Delaunay triangulation from Pentagram.
Delaunay triangles generated by Delaunay triangulation from Pentagram.
Wenqing Cheng (294855) +4 more
core +1 more source
Constrained Delaunay Triangulation for Wireless Sensor Networks
Wireless Sensor Networks (WSN), an element of pervasive computing, are presently being used on a large scale to monitor real-time environmental status. WSN has the potential of significantly enhancing our ability to monitor and interact with our physical environment.
openaire +1 more source
Proximal delaunay triangulation regions
Peters, James FrancisThis article introduces proximal Delau-nay triangulation regions and strongly near (also called overlap) Delaunay triangles. A main result in this paper is the proof that proximal Delaunay triangulation regions are convex polygons ...
LHCb Collaboration
core

