Sciweavers

176 search results - page 35 / 36
» Unbalanced Points and Vertices Problem
Sort
View
CCCG
2008
14 years 9 days ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
ISAAC
2007
Springer
80views Algorithms» more  ISAAC 2007»
14 years 5 months ago
Geometric Streaming Algorithms with a Sorting Primitive
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
Eric Y. Chen
SSD
2001
Springer
128views Database» more  SSD 2001»
14 years 3 months ago
Creating Representations for Continuously Moving Regions from Observations
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
Erlend Tøssebro, Ralf Hartmut Güting
BMCBI
2010
183views more  BMCBI 2010»
13 years 11 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
CVPR
2011
IEEE
13 years 2 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...