Constrained delaunay triangulation

Results 31 to 40 of about 681,623 (204)

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

Journal 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, Edwin A. Quintero, Miguel A. Parra +2 more
doaj +1 more source

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real‐World Data

Advanced Intelligent Discovery, EarlyView.
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source

Geração de malhas para domínios 2,5 dimensionais usando triangulação de delaunay restrita [PDF]

, 2012
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-graduação em Engenharia Mecânica, Florianópolis, 2001.Gerar uma malha consiste em discretizar um domínio geométrico em pequenos elementos de forma ...
Maliska Junior, Clovis Raimundo
core

Solving the horizontal conflation problem with a constrained Delaunay triangulation [PDF]

Journal of Geographical Systems, 2016
Datasets produced by different countries or organisations are seldom properly aligned and contain several discrepancies (e.g., gaps and overlaps). This problem has been so far almost exclusively tackled by snapping vertices based on a user-defined threshold.
Hugo Ledoux, Ken Arroyo Ohori
openaire +4 more sources

Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning

Advanced Intelligent Discovery, EarlyView.
This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley +1 more source

ISPRS International Journal of Geo-Information, 2018
Although shape similarity is one fundamental element in coastline generalization quality, its related research is still inadequate. Consistent with the hierarchical pattern of shape recognition, the Dual-side Bend Forest Shape Representation Model is ...
Zhaoxing Li, Jingsheng Zhai, Fang Wu
doaj +1 more source

Optimizing Strategies for Non‐Invasive Prospection of Settlements in the Intertidal Zone: A Case Study From the Centre of the Drowned Medieval Village of Tolsende (Scheldt Estuary, the Netherlands)

Archaeological Prospection, EarlyView.
ABSTRACT Medieval and early modern drowned villages in the intertidal zone of the Scheldt estuary (the Netherlands) constitute intriguing yet largely understudied components of north‐western Europe's underwater cultural heritage. Despite their high archaeological potential as time capsules of past settlement landscapes, research has remained limited ...
Jan Trachet +9 more
wiley +1 more source

FAULT TOLERANCE IN WIRELESS SENSOR NETWORKS USING CONSTRAINED DELAUNAY TRIANGULATION [PDF]

, 2020
Fault tolerance is one of the main issues in Wireless Sensor Networks (WSNs) since it becomes critical in real deployment environment where reliability and reduced inaccessibility times are important.
SWAIN, SANTOSH KUMAR +3 more
core +1 more source

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

Computation
We propose a method for generating a constrained Delaunay triangulation CDT applied to labeled 2D images with high morphological complexity. In the previous paper, Part 1, we established an unbiased planar straight-line graph (PLSG) on image objects of ...
F. N’Guyen, T. Kanit, A. Imad
doaj +1 more source

Real‐Time Conformal Maps and Parameterizations

Computer Graphics Forum, EarlyView.
Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source

delaunay triangulation
technology
computational geometry

medicine
algorithms