Results 141 to 150 of about 5,737 (222)

On the use of elliptic PDEs for the parameterisation of planar multipatch domains: Part 1: Numerical algorithms and foundations of parametric control. [PDF]

Eng Comput
Hinz J, Buffa A.
europepmc   +1 more source

Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. [PDF]

Discrete Comput Geom, 2016
Aurenhammer F, Walzl G.
europepmc   +1 more source

Automated Lung Segmentation from HRCT Scans with Diffuse Parenchymal Lung Diseases. [PDF]

J Digit Imaging, 2016
Pulagam AR, Kande GB, Ede VK, Inampudi RB.   +3 more
europepmc   +1 more source

Synergistic lignin construction of a long-chain branched polypropylene and its properties. [PDF]

RSC Adv, 2020
Tian B, Li J, Li Z, Xu N, Yao G, Zhang N, Dong W, Liu Y, Di M.   +8 more
europepmc   +1 more source

Any Monotone Boolean Function Can Be Realized by Interlocked Polygons

, 2010
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara   +2 more
openalex   +1 more source

Path Planning for Semi-automated Simulated Robotic Neurosurgery. [PDF]

Rep U S, 2015
Hu D, Gong Y, Hannaford B, Seibel EJ.
europepmc   +1 more source

An Almost Linear Time Algorithm for Field Splitting in Radiation Therapy. [PDF]

Comput Geom, 2013
Wu X, Dou X, Bayouth JE, Buatti JM.
europepmc   +1 more source

Any Monotone Function is Realized by Interlocked Polygons

Any Monotone Function is Realized by Interlocked Polygons
Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that makes the set of interlocked polygons free (not interlocked).
openaire  

A sample implementation for parallelizing Divide-and-Conquer algorithms on the GPU. [PDF]

Heliyon, 2018
Mei G, Zhang J, Xu N, Zhao K.
europepmc   +1 more source

Refined Universality for Critical KCM: Upper Bounds. [PDF]

Commun Math Phys
Hartarsky I.
europepmc   +1 more source