Results 21 to 30 of about 7,960 (210)

AUTOMATIC EXTRACTION OF TIDE-COORDINATED SHORELINE USING OPEN SOURCE SOFTWARE AND LANDSAT IMAGERY [PDF]

open access: yesThe 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

Efficient Terrain Triangulation and Modification Algorithms for Game Applications

open access: yesInternational 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

Recognizing Linear Building Patterns in Topographic Data by Using Two New Indices based on Delaunay Triangulation

open access: yesISPRS 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

Counting Triangulations and other Crossing-Free Structures Approximately [PDF]

open access: yes, 2014
We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster than by ...
Alvarez, Victor   +3 more
core   +1 more source

Planning-oriented optimization strategy for visualizing power distribution networks: from global to local

open access: yesInternational 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

Recovery of Asteroids from Observations of Too-Short Arcs by Triangulating Their Admissible Regions

open access: yesJournal of Astronomy and Space Sciences, 2021
The data set collected during the night of the discovery of a minor body constitutes a too-short arc (TSA), resulting in failure of the differential correction procedure.
Daniela Espitia   +2 more
doaj   +1 more source

Constrained boundary recovery for three dimensional Delaunay triangulations [PDF]

open access: yesInternational Journal for Numerical Methods in Engineering, 2004
AbstractA new constrained boundary recovery method for three dimensional Delaunay triangulations is presented. It successfully resolves the difficulties related to the minimal addition of Steiner points and their good placement. Applications to full mesh generation are discussed and numerical examples are provided to illustrate the effectiveness of ...
Du, Qiang, Wang, Desheng
openaire   +1 more source

Planar maps, circle patterns and 2d gravity [PDF]

open access: yes, 2013
Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point process.
David, Francois, Eynard, Bertrand
core   +3 more sources

Defining Geographical Rating Territories in Auto Insurance Regulation by Spatially Constrained Clustering

open access: yesRisks, 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

Computing Three-dimensional Constrained Delaunay Refinement Using the GPU

open access: yes, 2019
We propose the first GPU algorithm for the 3D triangulation refinement problem. For an input of a piecewise linear complex $\mathcal{G}$ and a constant $B$, it produces, by adding Steiner points, a constrained Delaunay triangulation conforming to ...
Chen, Zhenghai, Tan, Tiow-Seng
core   +1 more source

Home - About - Disclaimer - Privacy