An orthogonal drawing of a plane graph G is a drawing of G in which each edge is drawn as a sequence of alternate horizontal and vertical line segments. In this paper we give a linear-time algorithm to find an orthogonal drawing of a given 3-connected cubic plane graph with the minimum number of bends. The best previously known algorithm takes time O(n √ log n) for any plane graph with n vertices.

The purpose of this paper is to generalize the Delaunay[13] triangulation onto surfaces. A formal definition and an appropriate algorithm are presented. Starting from a plane domain Delaunay triangulation definition, a theoretical approach is evolved (which is a background for further considerations). It has been proven that, in the case of a plane surface, the introduced Delaunay triangulation...

An image contrast enhancement algorithm based on discriminant analysis is presented in this paper. An automatic adaptive segmentation algorithm, based on discriminant analysis, is utilized to segment the gray-values of an image into several clusters. After the adaptive segmentation algorithm, different object components of the image are segmented into separate clusters, called object planes. Th...

We report an algorithm for detecting planes from disparity maps, without computing 3-D information explicitly. Camera calibration is not assumed unless Euclidean plane parameters are required. The algorithm identifies co-planar image patches, thus providing a useful tools in the presence of occlusions. The basic components are a closed-form expression for the disparity of a plane, and a Hough-l...

objectives to compare an out-of-plane interscalene catheter technique to the in-plane technique in a randomized clinical trial. patients and methods eighty-four patients undergoing open shoulder surgery were randomized to either the in-plane or out-of-plane ultrasound-guided continuous interscalene technique. the primary outcome was vas pain rating at 24 hours. secondary outcomes included pain ...

In this paper, we propose an algorithm called Optimum Intensity Based Distributed Hiding (OIBDH) for secret data hiding inside cover images. The algorithm is a modified version of Bit Plane Splicing LSB technique with better hidden capacity and improved embedding process. The proposed algorithm outperforms Bit Plane Splicing LSB technique as more data can be hidden without degrading the quality...

In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely convergent convex hull tree algorithm which constructs a linear program that has the same optimal solution as the associated MILP. In addition, we combine the standard notion of sequential cutting planes...

Introduction Automated scan plane planning is expected to provide consistent scan plane prescriptions and to improve MRI scanner usability. Consistent scan planes are useful for follow-up examinations. The typical workflow of a scan plane setup requires careful manual positioning, and it suffers from inter-operator variability. Furthermore, having to perform a scan plane setup for each examinat...

Techniques for retrieving the phase of an optical field typically depend on assumptions about the amplitude of the field in a desired plane, usually a pupil plane. We describe an approach that makes no such assumptions and is capable of retrieving both the amplitude and phase in the desired plane. Intensity measurements in two or more planes are used by a nonlinear optimization algorithm to ret...

In this paper we present an algorithm to correct 3D reconstruction errors of 3D ultrasound catheter caused by ultrasound image thickness. We also provide a method to quickly measure ultrasound image plane's thickness. With thickness correction registration accuracy of navigation system using 3D ultrasound catheters can be improved by 20%.