We discuss generalized proximity operators (GPO) and their associated generalized projection problems. On inputs of size n, we show how to efficiently apply GPOs and generalized projections for separable norms and distance-like functions to accuracy in O(n log(1/ )) time. We also derive projection algorithms that run theoretically in O(n log n log(1/ )) time but can for suitable parameter range...

We have found experimentally that the critical current of a square thin-film superconducting transition-edge sensor (TES) depends exponentially upon the side length L and the square root of the temperature T, a behavior that has a natural theoretical explanation in terms of longitudinal proximity effects if the TES is regarded as a weak link between superconducting leads. As a consequence, the ...

Objective The purpose of this study was to investigate factors influencing the success rate of orthodontic microimplants (OMIs) using panoramic radiographs (PRs). Methods We examined 160 OMIs inserted bilaterally in the maxillary buccal alveolar bone between the second premolars and first molars of 80 patients (51 women, 29 men; mean age, 18.0 ± 6.1 years) undergoing treatment for malocclusio...

Objective: To assess the reliability of fi ve intra oral periapical radiography (IOPAR) radiographic signs, and to compare the reliability of IOPAR with that of cone-beam computerized tomography (CBCT) for determining the proximity of impacted mandibular third molar and mandibular canal. Methods: The present study consisted of 50 subjects, in age group of 18-30 years with impacted mandibular th...

o bjective: to determine the etiology, signs and symptoms, angiography indications and angiography findings in patients with limb penetrating injuries suspected to have arterial injury. m e thods: this was a cross-sectional study being performed in imam reza hospital affiliated with mashhad university of medical sciences, iran between september 2011 and march 2013. we included those patients wi...

The best approximation problem in a hyperconvex metric space consists of finding conditions for given set-valued mappings F andG and a setX such that there is a point x0 ∈ X satisfying d G x0 , F x0 ≤ d x, F x0 for x ∈ X. When G I, the identity mapping, and when the set X is compact, best approximation theorems for mappings in hyperconvex metric spaces are given for the single-valued case in 1–...

Many algorithms have to deal with multiple representations of the same object. The process of aligning these representations is called registration. In this paper we present a new approach for the registration of free-form surfaces which is not based on finding closest points. Instead, our algorithm takes advantage of the graphics hardware and uses the depth buffer for determining the distance ...

The proximity relations inherent in triangulations of geometric data can be exploited in the implementation of nearest-neighbour search procedures. This is relevant to applications such as terrain analysis, cartography and robotics, in which triangulations may be used to model the spatial data. Here we describe neighbourhood search procedures within constrained Delaunay triangulations of the ve...