Results 21 to 30 of about 681,623 (204)
Efficient Terrain Triangulation and Modification Algorithms for Game Applications
International Journal of Computer Games Technology, 2008 An efficient terrain generation algorithm is developed, based on constrained conforming Delaunay triangulation. The density of triangulation in different regions of a terrain is determined by its flatness, as seen from a height map, and a control map ...
Sundar Raman, Zheng Jianmin
doaj +1 more source
Computing 2D Constrained Delaunay Triangulation Using the GPU [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2012 We propose the first graphics processing unit (GPU) solution to compute the 2D constrained Delaunay triangulation (CDT) of a planar straight line graph (PSLG) consisting of points and edges. There are many existing CPU algorithms to solve the CDT problem in computational geometry, yet there has been no prior approach to solve this problem efficiently ...
Meng Qi, Thanh-Tung Cao, Tiow Seng Tan
openaire +3 more sources
Good triangulations yield good tours [PDF]
, 2008 Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give
Pearson, N, Letchford, A N
core +5 more sources
Splitting a Delaunay Triangulation in Linear Time [PDF]
, 2001 Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed.
Olivier Devillers +17 more
core +6 more sources
AUTOMATIC EXTRACTION OF TIDE-COORDINATED SHORELINE USING OPEN SOURCE SOFTWARE AND LANDSAT IMAGERY [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2015 Due to both natural and anthropogenic causes, the coastal lines keeps changing dynamically and continuously their shape, position and extend over time.
G. Gonçalves +3 more
doaj +1 more source
Parallel constrained Delaunay triangulation [PDF]
, 2013 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
Coll Arnau, Narcís +5 more
core +2 more sources
ISPRS International Journal of Geo-Information, 2020 Building pattern recognition is fundamental to a wide range of downstream applications, such as urban landscape evaluation, social analyses, and map generalization. Although many studies have been conducted, there is still a lack of satisfactory results,
Xianjin He, Min Deng, Guowei Luo
doaj +1 more source
Graph Theory and Mean Shift Segmentation Based Classification of Building Facades [PDF]
, 2011 Automatic classification of building facades has become a field of interest for researchers, since it can provide important solutions to many remote sensing research field.
Sirmacek, Beril, Beril Sirmacek
core +1 more source
Risks, 2019 Territory design and analysis using geographical loss cost are a key aspect in auto insurance rate regulation. The major objective of this work is to study the design of geographical rating territories by maximizing the within-group homogeneity, as well ...
Shengkun Xie
doaj +1 more source
International Journal of Digital Earth, 2021 The spatial distribution of power facilities is uneven, thereby making the topology of geographical wiring diagrams (GWDs) based on the actual coordinates unclear. A single-line diagram has the advantage of a clear topology but it lacks spatial locations.
Rui Li +3 more
doaj +1 more source