Results 1  10
of
1,217,617
modeling. RigidCLL: Avoiding Constantdistance Computations in
"... Many of the existing molecular simulation tools require the efficient identification of the set of nonbonded interacting atoms. This is necessary, for instance, to compute the energy values or the steric contacts between atoms. Cell linkedlists can be used to determine the pairs of atoms closer th ..."
Abstract
 Add to MetaCart
different improvement strategy based on avoiding to fill cells with those atoms that are always at a constant distance of a given atom. This technique is particularly effective when large groups of the particles in the simulation behave as rigid bodies as it is the case in simplified models considering only
SETS OF CONSTANT DISTANCE FROM A JORDAN CURVE
"... Abstract. We study the level sets of the signed distance function to a planar Jordan curve Γ, and ask what properties of Γ ensure that the level sets are Jordan curves, or uniform quasicircles, or uniform chordarc curves for all sufficiently small . Sufficient conditions are given in term of a sc ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We study the level sets of the signed distance function to a planar Jordan curve Γ, and ask what properties of Γ ensure that the level sets are Jordan curves, or uniform quasicircles, or uniform chordarc curves for all sufficiently small . Sufficient conditions are given in term of a
ON SETS OF CONSTANT DISTANCE FROM A PLANAR SET
"... Abstract. In this paper we prove that dboundaries Dd = {x: dist(x, Z) = d} of a compact Z ⊂ R2 are closed absolutely continuous curves for d greater than some constant depending on Z. It is also shown that Dd is a trajectory of solution to the Cauchy Problem of a differential equation with a disco ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this paper we prove that dboundaries Dd = {x: dist(x, Z) = d} of a compact Z ⊂ R2 are closed absolutely continuous curves for d greater than some constant depending on Z. It is also shown that Dd is a trajectory of solution to the Cauchy Problem of a differential equation with a
Research Announcement CONTINUA OF CONSTANT DISTANCES RELATED TO THE SPANS
"... The purpose of this note is to announce some results which complement and can, perhaps, offer a better handling of the concept of the span for compact metric spaces. A complete version with proofs and applications will be pub lished elsewhere. All spaces are assumed to be nonempty metric spaces, an ..."
Abstract
 Add to MetaCart
The purpose of this note is to announce some results which complement and can, perhaps, offer a better handling of the concept of the span for compact metric spaces. A complete version with proofs and applications will be pub lished elsewhere. All spaces are assumed to be nonempty metric spaces, and all mappings to be continuous functions. Let f: X ~ Y be a mapping. If X is connected, the surjective span o*(f) of f is defined to be the least upper bound of the set of real numbers a with the following property: there exist nonempty connected sets C C X x X such that a dist[f(x), f(x')] ~ a for (x,x') E C, and
Capacity of Ad Hoc Wireless Networks
"... Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examine ..."
Abstract

Cited by 632 (14 self)
 Add to MetaCart
examines these factors alone and in combination, using simulation and analysis from first principles. Our results include both specific constants and general scaling relationships helpful in understanding the limitations of wireless ad hoc networks. We examine interactions of the 802.11 MAC and ad hoc
Free Vibrations of a Pinended Column With Constant Distance Between Ends
"... Numerical results are presented for a uniform beam. The result for vanishing deflection, Xo = 97.395, for a division of the beam into 20 parts, compares very well with the exact value X 0 = ir 4 = 97.409. When the longitudinal inertia terms in equation ..."
Abstract
 Add to MetaCart
Numerical results are presented for a uniform beam. The result for vanishing deflection, Xo = 97.395, for a division of the beam into 20 parts, compares very well with the exact value X 0 = ir 4 = 97.409. When the longitudinal inertia terms in equation
CONJUGATE TANGENT VECTORS AND ASYMPTOTIC DIRECTIONS FOR SURFACES AT A CONSTANT DISTANCE FROM EDGE OF REGRESSION ON A SURFACE IN E31
"... Abstract. In this paper we give conjugate tangent vectors and asymptotic directions for surfaces at a constant distance from edge of regression on a surface in E31. 1. ..."
Abstract
 Add to MetaCart
Abstract. In this paper we give conjugate tangent vectors and asymptotic directions for surfaces at a constant distance from edge of regression on a surface in E31. 1.
Searching by rules: Pigeons’ (Columba livia) landmarkbased search according to constant bearing or constant distance
 Journal of Comparative Psychology
, 2003
"... Pigeons (Columba livia) searched for a goal location defined by a constant relative spatial relationship to 2 landmarks. For one group, landmarktogoal bearings remained constant while distance varied. For another group, landmarktogoal distances remained constant while direction varied. Birds wer ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Pigeons (Columba livia) searched for a goal location defined by a constant relative spatial relationship to 2 landmarks. For one group, landmarktogoal bearings remained constant while distance varied. For another group, landmarktogoal distances remained constant while direction varied. Birds
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 395 (2 self)
 Add to MetaCart
approximation algorithms for all these problems achieved a constantfactor approximation. We also give efficient approximation schemes for Euclidean MinCost Matching, a problem that can be solved exactly in polynomial time. All our algorithms also work, with almost no modification, when distance is measured
Results 1  10
of
1,217,617