Results 11  20
of
106,952
Solving the Graph Planarization Problem Using an Improved Genetic Algorithm
, 2006
"... An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number of ..."
Abstract
 Add to MetaCart
An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number
Optimal search in planar subdivisions
 SIAM JOURNAL OF COMPUTING, VOLTUNE
, 1983
"... A planar subdivision is any partition of the plane into (possibly unbounded) polygonal regions. The subdivision search problem is the following: given a subdivision S with n line segments and a query point P, determine which region of S contains P. We present a practical algorithm for subdivision s ..."
Abstract

Cited by 273 (3 self)
 Add to MetaCart
A planar subdivision is any partition of the plane into (possibly unbounded) polygonal regions. The subdivision search problem is the following: given a subdivision S with n line segments and a query point P, determine which region of S contains P. We present a practical algorithm for subdivision
Robust Distributed Network Localization with Noisy Range Measurements
, 2004
"... This paper describes a distributed, lineartime algorithm for localizing sensor network nodes in the presence of range measurement noise and demonstrates the algorithm on a physical network. We introduce the probabilistic notion of robust quadrilaterals as a way to avoid flip ambiguities that otherw ..."
Abstract

Cited by 403 (20 self)
 Add to MetaCart
that otherwise corrupt localization computations. We formulate the localization problem as a twodimensional graph realization problem: given a planar graph with approximately known edge lengths, recover the Euclidean position of each vertex up to a global rotation and translation. This formulation is applicable
Adaptive Finite Element Mesh Generation for Dynamic Planar Problems
"... In structural design and analysis used for hazard mitigation systems, automation is becoming an essential feature. For analysis, the finite element method has proven to be an effective approximate method if proper element types and meshes are chosen. Recently, the method has been successfully applie ..."
Abstract
 Add to MetaCart
, a computationally efficient dynamically adaptive finite element mesh generation scheme for dynamic analyses of planar problems is described. The concept of representative strain value is used for error estimates and the refinements of meshes use combinations of the hmethod (node movement) and the r
Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation
, 1991
"... This paper addresses the problem of parametric representation and estimation of complex planar curves in 2D, surfaces in 3D and nonplanar space curves in 3D. Curves and surfaces can be defined either parametrically or implicitly, and we use the latter representation. A planar curve is the set o ..."
Abstract

Cited by 314 (2 self)
 Add to MetaCart
This paper addresses the problem of parametric representation and estimation of complex planar curves in 2D, surfaces in 3D and nonplanar space curves in 3D. Curves and surfaces can be defined either parametrically or implicitly, and we use the latter representation. A planar curve is the set
Fortran Subroutines For Approximate Solution Of Graph Planarization Problems Using Grasp
, 1997
"... We describe Fortran subroutines for finding approximate solutions of the maximum planar subgraph problem (graph planarization) using a Greedy Randomized Adaptive Search Procedure (GRASP). The design and implementation of the code are described in detail. Computational results with the subroutines i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe Fortran subroutines for finding approximate solutions of the maximum planar subgraph problem (graph planarization) using a Greedy Randomized Adaptive Search Procedure (GRASP). The design and implementation of the code are described in detail. Computational results with the subroutines
Creating Full View Panoramic Image Mosaics and Environment Maps
, 1997
"... This paper presents a novel approach to creating full view panoramic mosaics from image sequences. Unlike current panoramic stitching methods, which usually require pure horizontal camera panning, our system does not require any controlled motions or constraints on how the images are taken (as long ..."
Abstract

Cited by 340 (29 self)
 Add to MetaCart
as there is no strong motion parallax). For example, images taken from a handheld digital camera can be stitched seamlessly into panoramic mosaics. Because we represent our image mosaics using a set of transforms, there are no singularity problems such as those existing at the top and bottom of cylindrical
Approximation Algorithms for Projective Clustering
 Proceedings of the ACM SIGMOD International Conference on Management of data, Philadelphia
, 2000
"... We consider the following two instances of the projective clustering problem: Given a set S of n points in R d and an integer k ? 0; cover S by k hyperstrips (resp. hypercylinders) so that the maximum width of a hyperstrip (resp., the maximum diameter of a hypercylinder) is minimized. Let w ..."
Abstract

Cited by 302 (22 self)
 Add to MetaCart
be the smallest value so that S can be covered by k hyperstrips (resp. hypercylinders), each of width (resp. diameter) at most w : In the plane, the two problems are equivalent. It is NPHard to compute k planar strips of width even at most Cw ; for any constant C ? 0 [50]. This paper contains four main
Faster ShortestPath Algorithms for Planar Graphs
 STOC 94
, 1994
"... We give a lineartime algorithm for singlesource shortest paths in planar graphs with nonnegative edgelengths. Our algorithm also yields a lineartime algorithm for maximum flow in a planar graph with the source and sink on the same face. The previous best algorithms for these problems required\O ..."
Abstract

Cited by 200 (15 self)
 Add to MetaCart
We give a lineartime algorithm for singlesource shortest paths in planar graphs with nonnegative edgelengths. Our algorithm also yields a lineartime algorithm for maximum flow in a planar graph with the source and sink on the same face. The previous best algorithms for these problems required
Scalebased description and recognition of planar curves and twodimensional shapes
, 1986
"... The problem of finding a description, at varying levels of detail, for planar curves and matching two such descriptions is posed and solved in this paper. A number of necessary criteria are imposed on any candidate solution method. Pathbased Gaussian smoothing techniques are applied to the curve to ..."
Abstract

Cited by 213 (3 self)
 Add to MetaCart
The problem of finding a description, at varying levels of detail, for planar curves and matching two such descriptions is posed and solved in this paper. A number of necessary criteria are imposed on any candidate solution method. Pathbased Gaussian smoothing techniques are applied to the curve
Results 11  20
of
106,952