Results 1  10
of
631,525
Continuous Motion in Discrete Space
 Principles of Knowledge Representation and Reasoning: Proceedings of the Seventh International Conference (KR2000
, 2000
"... A number of situations arise in the context of knowledge representation where some notion of continuity is desired within a framework that is itself discrete. We survey some varieties of discrete space that have been proposed, and show that they can all be described as instances of a general n ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
notion of closure space, of which topological spaces are a specialised subclass. We extend the usual topological denition of continuity in the obvious way to general closure spaces, and investigate the possible types of continuous motion that arise when both time and space are represented
Can continuous motion be an illusion?
"... It is widely accepted that continuity is the most essential characteristic of motion; the motion of macroscopic objects is apparently continuous, and classical mechanics, which describes such motion, is also based on the assumption of continuous motion. But is motion really continuous in reality? In ..."
Abstract
 Add to MetaCart
It is widely accepted that continuity is the most essential characteristic of motion; the motion of macroscopic objects is apparently continuous, and classical mechanics, which describes such motion, is also based on the assumption of continuous motion. But is motion really continuous in reality
TelegraphCQ: Continuous Dataflow Processing for an Uncertan World
, 2003
"... Increasingly pervasive networks are leading towards a world where data is constantly in motion. In such a world, conventional techniques for query processing, which were developed under the assumption of a far more static and predictable computational environment, will not be sufficient. Instead, qu ..."
Abstract

Cited by 514 (23 self)
 Add to MetaCart
Increasingly pervasive networks are leading towards a world where data is constantly in motion. In such a world, conventional techniques for query processing, which were developed under the assumption of a far more static and predictable computational environment, will not be sufficient. Instead
Articulated body motion capture by annealed particle filtering
 In IEEE Conf. on Computer Vision and Pattern Recognition
, 2000
"... The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach is to intr ..."
Abstract

Cited by 492 (4 self)
 Add to MetaCart
The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach
Bimodal Spatial Reasoning with Continuous Motion
 In Proceedings of the TwentyThird AAAI Conference on Artificial Intelligence (AAAI08
, 2008
"... Symbolic AI systems typically have difficulty reasoning about motion in continuous environments, such as determining whether a cornering car will clear a close obstacle. Bimodal systems, integrating a qualitative symbolic system with a quantitative diagramlike spatial representation, are capable of ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Symbolic AI systems typically have difficulty reasoning about motion in continuous environments, such as determining whether a cornering car will clear a close obstacle. Bimodal systems, integrating a qualitative symbolic system with a quantitative diagramlike spatial representation, are capable
The Vector Field Histogram  Fast Obstacle Avoidance For Mobile Robots
 IEEE JOURNAL OF ROBOTICS AND AUTOMATION
, 1991
"... A new realtime obstacle avoidance method for mobile robots has been developed and implemented. This method, named the vector field histogram(VFH), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward the target. The VFH method uses a ..."
Abstract

Cited by 481 (24 self)
 Add to MetaCart
suitable sector from among all polar histogram sectors with a low polar obstacle density, and the steering of the robot is aligned with that direction. Experimental results from a mobile robot traversing densely cluttered obstacle courses in smooth and continuous motion and at an average speed of 0.6 0.7m
Snakes: Active contour models
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 1988
"... A snake is an energyminimizing spline guided by external constraint forces and influenced by image forces that pull it toward features such as lines and edges. Snakes are active contour models: they lock onto nearby edges, localizing them accurately. Scalespace continuation can be used to enlarge ..."
Abstract

Cited by 3955 (17 self)
 Add to MetaCart
A snake is an energyminimizing spline guided by external constraint forces and influenced by image forces that pull it toward features such as lines and edges. Snakes are active contour models: they lock onto nearby edges, localizing them accurately. Scalespace continuation can be used to enlarge
Continuous motion planning for information forecast
 in Proceedings of the 47th Conference on Decision and Control
, 2008
"... Abstract — This paper addresses planning of continuous paths for mobile sensors to improve longterm forecast performance. With the information gain defined by the mutual information between the continuous measurement path and the future verification variables, two expressions for computing the info ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract — This paper addresses planning of continuous paths for mobile sensors to improve longterm forecast performance. With the information gain defined by the mutual information between the continuous measurement path and the future verification variables, two expressions for computing
kSets and Continuous Motion in R³
, 2010
"... We prove several new results concerning ksets of point sets on the 2sphere (equivalently, for signed point sets in the plane) and ksets in 3space. Specific results include spherical generalizations of (i) Lovász’ lemma (regarding the number of spherical kedges intersecting a given great circle) ..."
Abstract
 Add to MetaCart
We prove several new results concerning ksets of point sets on the 2sphere (equivalently, for signed point sets in the plane) and ksets in 3space. Specific results include spherical generalizations of (i) Lovász’ lemma (regarding the number of spherical kedges intersecting a given great circle) and of (ii) the crossing identity for kedges due to Andrzejak et al. As a new ingredient compared to the planar case, the latter involves the winding number of kfacets around a given point in 3space, as introduced by Lee and by Welzl, independently. As a corollary, we obtain a crossing identity for the number of pinched crossings (crossing pairs of triangles sharing one vertex) of kfacets in 3space.
ViewDependent Refinement of Progressive Meshes
"... Levelofdetail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation defines for an arbitrary triangle mesh a sequence of approximating meshes optimized for viewindependent LOD. In this paper, ..."
Abstract

Cited by 458 (5 self)
 Add to MetaCart
and coarsening the mesh according to these criteria. The algorithm exploits view coherence, supports frame rate regulation, and is found to require less than 15 % of total frame time on a graphics workstation. Moreover, for continuous motions this work can be amortized over consecutive frames. In addition
Results 1  10
of
631,525