Results 61 to 70 of about 26,216 (246)
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition [PDF]
A geometric graph is angle-monotone if every pair of vertices has a path between them that---after some rotation---is $x$- and $y$-monotone. Angle-monotone graphs are $\sqrt 2$-spanners and they are increasing-chord graphs.
A Dumitrescu +16 more
core +3 more sources
Real‐Time Conformal Maps and Parameterizations
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
Load-Balancing for Parallel Delaunay Triangulations [PDF]
Computing the Delaunay triangulation (DT) of a given point set in $\mathbb{R}^D$ is one of the fundamental operations in computational geometry. Recently, Funke and Sanders (2017) presented a divide-and-conquer DT algorithm that merges two partial ...
A Aggarwal +16 more
core +3 more sources
Mesh Processing Non‐Meshes via Neural Displacement Fields
Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
wiley +1 more source
An Antigen Space Triangulation Coverage Based Real-Value Negative Selection Algorithm
Negative selection algorithm (NSA) is an important detector generation algorithm of artificial immune system (AIS). Traditional NSAs randomly generate detectors in the whole antigen space without considering the distribution of self/non-self antigens ...
Zhang Fan +4 more
doaj +1 more source
DELAUNAY TRIANGULATION PARALLEL CONSTRUCTION METHOD AND ITS APPLICATION IN MAP GENERALIZATION [PDF]
Delaunay triangulated irregular network (D-TIN) has been widely used in various fields and also played an increasingly important role on map generalization.
J. Shen, L. Guo, L. Qi, W. Zhu
doaj +1 more source
Universality theorems for inscribed polytopes and Delaunay triangulations [PDF]
We prove that every primary basic semialgebraic set is homotopy equivalent to the set of inscribed realizations (up to M\"obius transformation) of a polytope. If the semialgebraic set is moreover open, then, in addition, we prove that (up to homotopy) it
Adiprasito, Karim A. +2 more
core +1 more source
ABSTRACT The aim of this article is to exploit an innovative spatial econometric approach to map and study the evolving patterns of industrial districts (IDs). The procedure can be classified as a k‐means cluster‐wise regression procedure and is designed to detect homogeneous areas of subcontracting activity.
Jacopo Canello +3 more
wiley +1 more source
The deformation space of Delaunay triangulations of the sphere [PDF]
Yanwen Luo, Tianqi Wu, Xiaoping Zhu
openalex +1 more source
Investigation of Solution Accuracy in PFEM Simulations Using Benchmark Problems
ABSTRACT The simulation of large topological changes, such as those occurring in Cone Penetration Testing (CPT) and vibratory pile driving, remains a major challenge in computational geomechanics. Excessive mesh distortions render classical approaches like the Finite Element Method (FEM) unsuitable, emphasizing the need for alternative methodologies ...
Antaeus Bettmann +4 more
wiley +1 more source

