Results 11 to 20 of about 365,316 (225)

Robustness and Randomness [PDF]

, 2006
Robustness problems of computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities.
Foufou, Sebti, Michelucci, Dominique, Moreau, Jean Michel   +2 more
core   +1 more source

OpenACC Based GPU Parallelization of Plane Sweep Algorithm for Geometric Intersection [PDF]

, 2019
Line segment intersection is one of the elementary operations in computational geometry. Complex problems in Geographic Information Systems (GIS) like finding map overlays or spatial joins using polygonal data require solving segment intersections. Plane
AB Khlopotine, JL Bentley, M McKenney, MT Goodrich, MT Goodrich   +4 more
core   +2 more sources

MGOS: A library for molecular geometry and its operating system [PDF]

, 2019
The geometry of atomic arrangement underpins the structural understanding of molecules in many fields. However, no general framework of mathematical/computational theory for the geometry of atomic arrangement exists.
Bhak, Jong, Cha, Jehyun, Cho, Youngsong, Kim, Deok-Soo, Kim, Sang Wha, Laskowski, Roman A., Lee, Mokwon, Ryu, Joonghyun, Ryu, Seong Eon, Song, Chanyoung, Sugihara, Kokichi   +10 more
core   +2 more sources

EEG-Based User Reaction Time Estimation Using Riemannian Geometry Features [PDF]

, 2017
Riemannian geometry has been successfully used in many brain-computer interface (BCI) classification problems and demonstrated superior performance. In this paper, for the first time, it is applied to BCI regression problems, an important category of BCI
Gordon, Stephen, Jung, Tzyy-Ping, Lance, Brent J., Lawhern, Vernon J., Lin, Chin-Teng, Wu, Dongrui   +5 more
core   +1 more source

A scalable parallel finite element framework for growing geometries. Application to metal additive manufacturing [PDF]

, 2019
This work introduces an innovative parallel, fully-distributed finite element framework for growing geometries and its application to metal additive manufacturing.
Ayachit U, Burstedde C, Carslaw HS, Cole KD, Ern A, Kaufman L, Kergaßner A, Lindgren LE, Mozaffar M, Schroeder WJ, Wohlers Associates, Inc   +10 more
core   +2 more sources

On the complexity of optimal homotopies [PDF]

, 2017
In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions.
Chambers, Erin Wolf, de Mesmay, Arnaud, Ophelders, Tim   +2 more
core   +2 more sources

On Reconfiguring Tree Linkages: Trees can Lock [PDF]

, 2000
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex.
Biedl, Therese, Demaine, Erik, Demaine, Martin, Lazard, Sylvain, Lubiw, Anna, O'Rourke, Joseph, Robbins, Steve, Streinu, Ileana, Toussaint, Godfried, Whitesides, Sue   +9 more
core   +10 more sources

Data Fusion of Objects Using Techniques Such as Laser Scanning, Structured Light and Photogrammetry for Cultural Heritage Applications

, 2015
In this paper we present a semi-automatic 2D-3D local registration pipeline capable of coloring 3D models obtained from 3D scanners by using uncalibrated images.
A Gallo, AW Fitzgibbon, DG Lowe, F Bernardini, H Lensch, HH Ip, JH Zhu, K Ikeuchi, M Callieri, M Corsini, M Dellepiane, M Dellepiane, M Pollefeys, MA Fischler, N Snavely, N Snavely, NR Pal, P Musialski, S Arya, SK Naik, Y Furukawa   +20 more
core   +3 more sources

IGA-based Multi-Index Stochastic Collocation for random PDEs on arbitrary domains

, 2019
This paper proposes an extension of the Multi-Index Stochastic Collocation (MISC) method for forward uncertainty quantification (UQ) problems in computational domains of shape other than a square or cube, by exploiting isogeometric analysis (IGA ...
Beck, Joakim, Tamellini, Lorenzo, Tempone, Raúl   +2 more
core   +1 more source

Quantum picturalism for topological cluster-state computing

, 2020
Topological quantum computing is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state.
Abramsky S, Bravyi S B Kitaev A Y, Clare Horsman, Coecke B, Coecke B, Dixon L Duncan R Kissinger A Merry A, Duncan R Perdrix S, Duncan R Perdrix S, Fowler A G, Freedman M H Kitaev A Larsen M J Wang Z, Gottesman D, Kissinger A, Penrose R, Raussendorf R, Shor P W, Simon J   +15 more
core   +1 more source