Results 1  10
of
5,454
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 628 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
Routing with Guaranteed Delivery in ad hoc Wireless Networks
, 2001
"... We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of ..."
Abstract

Cited by 849 (80 self)
 Add to MetaCart
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication
Plenoptic Modeling: An ImageBased Rendering System
, 1995
"... Imagebased rendering is a powerful new approach for generating realtime photorealistic computer graphics. It can provide convincing animations without an explicit geometric representation. We use the “plenoptic function” of Adelson and Bergen to provide a concise problem statement for imagebased ..."
Abstract

Cited by 760 (20 self)
 Add to MetaCart
Imagebased rendering is a powerful new approach for generating realtime photorealistic computer graphics. It can provide convincing animations without an explicit geometric representation. We use the “plenoptic function” of Adelson and Bergen to provide a concise problem statement for image
Estimating threedimensional motion parameters of a rigid planar patch, III: Finite point correspondences and threeview problem
 in Proc. IEEE Int. Conf ASSP
"... noise electron tubes, and superconductive parametric and storage devices. In 1965 he performed an experiment which first proved the existence of the Magnus force in superconductors and was a corecipient of the RCA Research Award for the development of a superconductive parametric amplifier. In 19 ..."
Abstract

Cited by 398 (3 self)
 Add to MetaCart
noise electron tubes, and superconductive parametric and storage devices. In 1965 he performed an experiment which first proved the existence of the Magnus force in superconductors and was a corecipient of the RCA Research Award for the development of a superconductive parametric amplifier. In 1966 he became Director of Advanced
The sliderpinning problem
 CCCG
, 2007
"... A Laman mechanism is a flexible planar barandjoint framework with m ≤ 2n − 3 edges and exactly k = 2n − m degrees of freedom. The sliderpinning problem is to eliminate all the degrees of freedom of a Laman mechanism, in an optimal fashion, by individually fixing x or y coordinates of vertices. We ..."
Abstract

Cited by 384 (7 self)
 Add to MetaCart
A Laman mechanism is a flexible planar barandjoint framework with m ≤ 2n − 3 edges and exactly k = 2n − m degrees of freedom. The sliderpinning problem is to eliminate all the degrees of freedom of a Laman mechanism, in an optimal fashion, by individually fixing x or y coordinates of vertices
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
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
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
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
Results 1  10
of
5,454