Results 1 to 10 of about 681,623 (204)
Zero-Watermarking for Vector Maps Combining Spatial and Frequency Domain Based on Constrained Delaunay Triangulation Network and Discrete Fourier Transform [PDF]
Entropy, 2023 With its lossless properties, zero-watermarking has attracted a lot of attention in the field of copyright protection for vector maps. However, the common zero-watermarking algorithm puts too much emphasis on mining for global features, making it ...
Xu Xi, Yang Hua, Yi Chen, Qiande Zhu
doaj +2 more sources
Constrained Delaunay Triangulation for Ad Hoc Networks [PDF]
Journal of Computer Systems, Networks, and Communications, 2008 Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper, we propose a new spanner called constrained Delaunay triangulation (CDT) which considers both geometric properties and ...
D. Satyanarayana, S. V. Rao
doaj +2 more sources
Restricted Constrained Delaunay Triangulations. [PDF]
, 2021 We introduce the restricted constrained Delaunay triangulation (restricted CDT), a generalization of both the restricted Delaunay triangulation and the constrained Delaunay triangulation. The restricted CDT is a triangulation of a surface whose edges include a set of user-specified constraining segments. We define the restricted CDT to be the dual of a
Khoury, Marc, Shewchuk, Jonathan Richard
openaire +4 more sources
Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons
Computational Geometry: Theory and Applications, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Günther Eder +2 more
exaly +4 more sources
A Collaborative Simplification Method for Multiple Coastlines Based on the Hierarchical Triangulation Network Partition [PDF]
Journal of Geodesy and Geoinformation Science, 2020 For the current automatic coastline generalization method, only one-line element is considered separately, but the relationship between the nearby elements is not effectively considered.
Lihua ZHANG,Lulu TANG,Shuaidong JIA,Zeyuan DAI
doaj +1 more source
Extracting Skeleton Lines from Building Footprints by Integration of Vector and Raster Data
ISPRS International Journal of Geo-Information, 2022 The extraction of skeleton lines of buildings is a key step in building spatial analysis, which is widely performed for building matching and updating. Several methods for vector data skeleton line extraction have been established, including the improved
Guoqing Chen, Haizhong Qian
doaj +1 more source
Applied Sciences, 2023 The development of smart vehicles has increased the demand for high-definition road maps. However, traditional road maps for vehicle navigation systems are not sufficient to meet the requirements of intelligent vehicle systems (e.g., autonomous driving).
Tian Lei, Gaoyao Xiao, Xiaohong Yin
doaj +1 more source
Constrained Construction of Planar Delaunay Triangulations without Flipping
Structural Mechanics of Engineering Constructions and Buildings, 2018 The construction of Voronoi diagrams and Delaunay triangulations finds wide application in many branches of science. Delaunay triangulations have properties which make them more desirable than other triangulations for the same node set.
Vera V Galishnikova, Peter Jan Pahl
doaj +1 more source
Environment Mapping Algorithm Using Semantic Description and Constrained Delaunay Triangulation
Elektronika ir Elektrotechnika, 2019 The article discusses the issue of creating an environment’s map with semantic division of areas. This simplifies some aspects of mobile robot control and permits the robot to carry out tasks issued in a human-understandable form. The article presents an
Daniel Figurowski, Pawel Dworak
doaj +1 more source
Essential Constraints of Edge-Constrained Proximity Graphs
Journal of Graph Algorithms and Applications, 2017 Given a plane forest $F = (V, E)$ of $|V| = n$ points, we find the minimum set $S \subseteq E$ of edges such that the edge-constrained minimum spanning tree over the set $V$ of vertices and the set $S$ of constraints contains $F$. We present an $O(n \log
Prosenjit Bose +3 more
doaj +1 more source