Results 21 to 30 of about 155,395 (263)
Integrated Surrogate Optimization of a Vertical Axis Wind Turbine
Energies, 2021 In this work, a 3D computational model based on computational fluid dynamics (CFD) is built to simulate the aerodynamic behavior of a Savonius-type vertical axis wind turbine with a semi-elliptical profile.
Marco A. Moreno-Armendáriz +3 more
doaj +1 more source
Computability in Computational Geometry
, 2005 We promote the concept of object directed computability in computational geometry in order to faithfully generalise the well-established theory of computability for real numbers and real functions. In object directed computability, a geometric object is computable if it is the effective limit of a sequence of finitary objects of the same type as the ...
Abbas Edalat +2 more
openaire +2 more sources
Fingerprint verification using computational geometry
Dyna, 2016 This paper presents a robust minutiae based method for fingerprint verification. The proposed method uses Delaunay Triangulation to represent minutiae as nodes of a connected graph composed of triangles.
Manuel Ramírez Flores +3 more
doaj +1 more source
Journal of Spatial Information Science, 2016 Point feature map labeling is a geometric visualization problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts).
Maarten Löffler +2 more
doaj +1 more source
Quantum Computation in Computational Geometry
Interdisciplinary Information Sciences, 2002 Summary: We discuss applications of quantum computation to geometric data processing. These applications include problems on convex hulls, minimum enclosing balls, linear programming, and intersection problems. Technically, we apply the well-known algorithm of \textit{L. K. Grover} [Proc. 28th annual ACM symposium 1996, 212--219 (1996; Zbl 0922.68044)]
SADAKANE, Kunihiko +2 more
openaire +1 more source
Finding Shortest Paths With Computational Geometry
Journal of Graph Algorithms and Applications, 2003 We present a heuristic search algorithm for the Rd Manhattan shortest path problem that achieves front-to-front bidirectionality in subquadratic time. In the study of bidirectional search algorithms, front-to-front heuristic computations were thought ...
Po-Shen Loh
doaj +1 more source
Computational geometry and discrete computations [PDF]
, 1996 In this paper we describe some problems arising in practical implementation of algorithms from computational geometry. Going to robust algorithms needs to solve issues such as rounding errors and degeneracies. Most of the problems are closely related to the incompatibility between on one side algorithms designed for continuous data and on the other ...
openaire +3 more sources
Investigating computational geometry for failure prognostics
International Journal of Prognostics and Health Management, 2014 Prognostics and Health Management (PHM) is a multidisciplinary field aiming at maintaining physical systems in their optimal functioning conditions.
Emmanuel Ramasso
doaj +1 more source
Journal of Computational Geometry, 2015 The Annual Symposium on Computational Geometry has a special issue in the Journal of Computational Geometry for the first time.
Siu-Wing Cheng, Olivier Devillers
doaj +1 more source
The geometry of quantum computation
Quantum Information and Computation, 2008 Whether the class Quantum Merlin Arthur is equal to QMA_1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a quantum oracle relative to which QMA\neqQMA_1. As a byproduct, we find that there are facts about quantum complexity classes that
Dowling, Mark R., Nielsen, Michael A.
openaire +4 more sources